Utilizing a geo-locator service and zone servers to reduce computer resource requirements for determining high quality solutions to routing problems

ABSTRACT

A method involves utilizing a geo-locator service and zone servers to reduce server resource requirements for determining high quality solutions to routing problems. The use of a geo-locator service and zone servers enables the use of servers having less memory which can handle determination of high quality solutions to routing problems involving locations spanning a smaller geographic area even if they are incapable of handling determination of high quality solutions to routing problems involving locations spanning a larger geographic area, and enables efficient assignment of requests to an appropriate server without unduly burdening high value servers having sufficient memory to handle determination of high quality solutions to routing problems involving locations spanning a very large geographic area with determination of high quality solutions to routing problems involving locations spanning a smaller geographic area.

The present application hereby incorporates herein by reference theentire disclosure of Appendices A-D.

COPYRIGHT STATEMENT

All of the material in this patent document is subject to copyrightprotection under the copyright laws of the United States and othercountries. The copyright owner has no objection to the facsimilereproduction by anyone of the patent document or the patent disclosure,as it appears in official governmental records but, otherwise, all othercopyright rights whatsoever are reserved.

BACKGROUND OF THE INVENTION

The present invention generally relates to software for providingsolutions to routing problems, such as vehicle routing problems.

Software which is configured to provide solutions to vehicle routingproblems is increasingly ubiquitous. Most smart phones offer access tosimplistic routing software which can be used to generate and display anoptimized route for a user's vehicle.

However, conventional approaches utilized by typical routing softwarepresent a number of problems, particularly when consideringdetermination of routing solutions for more complicated or complexrouting problems, such as those involving a large number of locations ora large geographical area.

Needs exist for improvement in providing solutions to routing problems.One or more of these needs and other needs are addressed by one or moreaspects of the present invention.

SUMMARY OF THE INVENTION

The present invention includes many aspects and features. Moreover,while many aspects and features relate to, and are described in, thecontext of vehicle routing, the present invention is not limited to useonly in this context, as will become apparent from the followingsummaries and detailed descriptions of aspects, features, and one ormore embodiments of the present invention.

One aspect relates to a method involving utilizing a geo-locator serviceand zone servers to reduce server resource requirements for determiningoptimized solutions to routing problems. The method includesmaintaining, by a geo-locator service at a first server, datacorresponding to a plurality of defined zones each corresponding to ageographic area, wherein each defined zone has a defined boundary, aplurality of the defined zones each overlap with other of the definedzones, and a plurality of the defined zones are each located entirelywithin another defined zone. The method further includes maintaining aplurality of servers, each server including road network data for arespective one of the zones of the plurality of defined zones;electronically communicating, from a requesting device to a geo-locatorservice at a first server, a request comprising information for aplurality of locations involved in a routing problem; electronicallydetermining, by the geo-locator service based on the list of locationsand the maintained list of defined zones, a smallest defined zone thatcontains all of the locations of the list of locations; electronicallyreturning, by the geo-locator service to the requesting device inresponse to the received request, data comprising an indication of thedetermined zone and an identifier for the zone server corresponding tothe determined zone; electronically communicating, from the requestingdevice to the zone server corresponding to the determined zone based onthe returned identifier for the zone server, problem data for therouting problem comprising data for the plurality of locations involvedin the routing problem; electronically determining, at the zone servercorresponding to the determined zone, a set of one or more optimizedsolutions to the routing problem using a plurality of calculated traveltime estimates accessed from one or more computed shortest pathmatrices; and returning, from the zone server corresponding to thedetermined zone to the requesting device, data corresponding to thedetermined set of one or more optimized solutions to the routingproblem. The use of a geo-locator service and zone servers enables theuse of servers having less memory which can handle determination ofoptimized solutions to routing problems involving locations spanning asmaller geographic area even if they are incapable of handlingdetermination of optimized solutions to routing problems involvinglocations spanning a larger geographic area, and enables efficientassignment of requests to an appropriate server without unduly burdeninghigh value servers having sufficient memory to handle determination ofoptimized solutions to routing problems involving locations spanning avery large geographic area with determination of optimized solutions torouting problems involving locations spanning a smaller geographic area.

In a feature of this aspect, maintaining, by a geo-locator service at afirst server, data corresponding to a plurality of defined zones eachcorresponding to a geographic area comprises maintaining, for eachdefined zone, a list of coordinates defining the defined boundary forthat zone.

In a feature of this aspect, maintaining, by a geo-locator service at afirst server, data corresponding to a plurality of defined zones eachcorresponding to a geographic area comprises maintaining, for eachdefined zone, a list of latitude and longitude coordinates defining thedefined boundary for that zone.

In a feature of this aspect, electronically communicating, from arequesting device to a geo-locator service at a first server, a requestcomprising information for a plurality of locations involved in arouting problem comprises electronically communicating coordinates foreach of the plurality of locations.

In a feature of this aspect, electronically communicating, from arequesting device to a geo-locator service at a first server, a requestcomprising information for a plurality of locations involved in arouting problem comprises electronically communicating latitude andlongitude coordinates for each of the plurality of locations.

In a feature of this aspect, the returned identifier comprises a servername.

In a feature of this aspect, the returned identifier comprises aninternet protocol (IP) address.

In a feature of this aspect, the returned identifier comprises a uniformresource locator (URL).

In a feature of this aspect, the requesting device comprises a computerhaving a web browser loaded thereon, and wherein electronicallycommunicating, from a requesting device to a geo-locator service at afirst server, a request comprising information for a plurality oflocations involved in a routing problem comprises electronicallycommunicating via a web browser.

In a feature of this aspect, the requesting device comprises a computerhaving a web browser loaded thereon, and wherein electronicallycommunicating, from a requesting device to a geo-locator service at afirst server, a request comprising information for a plurality oflocations involved in a routing problem comprises electronicallycommunicating via hypertext transfer secure protocol (HTTPs).

In a feature of this aspect, the requesting device comprises a desktopcomputer.

In a feature of this aspect, the requesting device comprises a laptopcomputer.

In a feature of this aspect, the requesting device comprises a tablet.

In a feature of this aspect, the requesting device comprises a phone.

Another aspect relates to a method involving utilizing a geo-locatorservice and zone servers to reduce server resource requirements fordetermining optimized solutions to routing problems. The method includesmaintaining, by a geo-locator service at a first server, datacorresponding to a plurality of defined zones each corresponding to ageographic area, wherein each defined zone has a defined boundary, aplurality of the defined zones each overlap with other of the definedzones, and a plurality of the defined zones are each located entirelywithin another defined zone. The method includes maintaining a pluralityof servers, each server including road network data for one or more ofthe zones of the plurality of defined zones; electronicallycommunicating, from a requesting device to a geo-locator service at afirst server, a request comprising information for a plurality oflocations involved in a routing problem; electronically determining, bythe geo-locator service based on the list of locations and themaintained list of defined zones, a smallest defined zone that containsall of the locations of the list of locations; electronically returning,by the geo-locator service to the requesting device in response to thereceived request, data comprising an identifier for accessing a zoneserver corresponding to the determined zone; electronically effecting,by the requesting device using the returned identifier for accessing azone server corresponding to the determined zone, communication ofproblem data for the routing problem comprising data for the pluralityof locations involved in the routing problem; electronicallydetermining, at one or more zone servers corresponding to the determinedzone in response to the effected communication of problem data, a set ofone or more optimized solutions to the routing problem using a pluralityof calculated travel time estimates accessed from one or more computedshortest path matrices; and returning, from the one or more zone serverscorresponding to the determined zone to the requesting device, datacorresponding to the determined set of one or more optimized solutionsto the routing problem. The use of a geo-locator service and zoneservers enables the use of servers having less memory which can handledetermination of optimized solutions to routing problems involvinglocations spanning a smaller geographic area even if they are incapableof handling determination of optimized solutions to routing problemsinvolving locations spanning a larger geographic area, and enablesefficient assignment of requests to an appropriate server without undulyburdening high value servers having sufficient memory to handledetermination of optimized solutions to routing problems involvinglocations spanning a very large geographic area with determination ofoptimized solutions to routing problems involving locations spanning asmaller geographic area.

In a feature of this aspect, the requesting device comprises a desktopcomputer.

In a feature of this aspect, the requesting device comprises a laptopcomputer.

In a feature of this aspect, the requesting device comprises a tablet.

In a feature of this aspect, the requesting device comprises a phone.

Another aspect relates to a method involving utilizing a geo-locatorservice and zone servers to reduce server resource requirements fordetermining optimized solutions to routing problems. The method includesmaintaining, by a geo-locator service at a first server, datacorresponding to a plurality of defined zones each corresponding to ageographic area, wherein each defined zone has a defined boundary, aplurality of the defined zones each overlap with other of the definedzones, and a plurality of the defined zones are each located entirelywithin another defined zone. The method further includes maintaining aplurality of servers, each server including road network data for one ormore of the zones of the plurality of defined zones; electronicallycommunicating, from a requesting device to a geo-locator service at afirst server, a request comprising information for a plurality oflocations involved in a routing problem; electronically determining, bythe geo-locator service based on the list of locations and themaintained list of defined zones, a smallest defined zone that containsall of the locations of the list of locations; electronically returning,by the geo-locator service to the requesting device in response to thereceived request, data comprising an identifier for accessing a zoneserver corresponding to the determined zone; electronically effecting,by the requesting device using the returned identifier for accessing azone server corresponding to the determined zone, communication ofproblem data for the routing problem comprising data for the pluralityof locations involved in the routing problem; electronically computing,at one or more zone servers corresponding to the determined zone inresponse to the effected communication of problem data, one or moreshortest path matrices comprising shortest path data for directionalshortest paths between pairs of locations of the plurality of locations;and returning, from the one or more zone servers corresponding to thedetermined zone to the requesting device, data corresponding to thecomputed one or more shortest path matrices. The use of a geo-locatorservice and zone servers enables the use of servers having less memorywhich can handle determination of optimized solutions to routingproblems involving locations spanning a smaller geographic area even ifthey are incapable of handling determination of optimized solutions torouting problems involving locations spanning a larger geographic area,and enables efficient assignment of requests to an appropriate serverwithout unduly burdening high value servers having sufficient memory tohandle determination of optimized solutions to routing problemsinvolving locations spanning a very large geographic area withdetermination of optimized solutions to routing problems involvinglocations spanning a smaller geographic area.

One aspect relates to a graphical user interface method involving one ormore graphical user interfaces for providing preferred solutions tomulti-objective routing problems. The method includes presenting, to auser via an electronic display associated with an electronic device, afirst graphical user interface comprising a map; receiving, from theuser via one or more input devices associated with the electronicdevice, first user input corresponding to identification of one or morelocations involved in a routing problem; receiving, from the user viaone or more input devices associated with the electronic device, seconduser input corresponding to engagement with a user interface elementconfigured to access a constraints graphical user interface; displaying,to the user via the electronic display associated with the electronicdevice, a second graphical user interface comprising one or more userinterface elements configured to allow a user to specify one or moreconstraints and, for each specified constraint, one or more penalties;receiving, from the user via one or more input devices associated withthe electronic device, third user input corresponding to definition ofone or more constraints, and, for each defined constraint, one or morepenalties; and electronically determining, based on the identificationof one or more locations involved in the routing problem and the definedconstraints and penalties, a plurality of preferred solutions to therouting problem. Such electronic determining comprises generating aplurality of potential solutions to the routing problem, calculating,for each generated solution, an estimated amount of time for traversalof routes involved in that generated solution, a weighted time valuebased on the calculated estimated amount of time for traversal of routesinvolved in that generated solution, and an adjusted value involving asum of the calculated weighted time value for that generated solutionand one or more penalty values calculated based on evaluation offeatures of that generated solution. Such electronic determining furthercomprises determining the plurality of preferred solutions based on thecalculated adjusted values. The method further includes displaying, tothe user via the electronic display associated with the electronicdevice, the determined plurality of preferred solutions, includingdisplaying, for one or more respective displayed solutions of thedetermined preferred solutions, an indication of one or more constraintsviolated by each respective displayed solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of an estimated total travel time for that solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of an estimated total travel distance for that solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of an estimated total travel cost for that solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of estimated total fuel required for that solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of an estimated total fuel cost for that solution.

In a feature of this aspect, displaying, to the user via the electronicdisplay associated with the electronic device, the determined pluralityof preferred solutions includes displaying, for each displayed solution,an indication of an estimated total labor cost for that solution.

Another aspect relates to a graphical user interface method involvingone or more graphical user interfaces for providing preferred solutionsto multi-objective routing problems. The method includes presenting, toa user via an electronic display associated with an electronic device, afirst graphical user interface comprising a map; receiving, from theuser via one or more input devices associated with the electronicdevice, first user input corresponding to identification of one or morelocations involved in a routing problem; receiving, from the user viaone or more input devices associated with the electronic device, seconduser input corresponding to engagement with a user interface elementconfigured to access a constraints graphical user interface; displaying,to the user via the electronic display associated with the electronicdevice, a second graphical user interface comprising one or more userinterface elements configured to allow a user to specify one or moreconstraints and, for each specified constraint, one or more penalties;receiving, from the user via one or more input devices associated withthe electronic device, third user input corresponding to definition ofone or more constraints, and, for each defined constraint, one or morepenalties; and electronically determining, based on the identificationof one or more locations involved in the routing problem and the definedconstraints and penalties, a plurality of preferred solutions to therouting problem. Such electronic determining comprises generating aplurality of potential solutions to the routing problem, calculating,for each generated solution, one or more penalty values based onevaluation of features of that generated solution, and determining theplurality of preferred solutions based at least in part on one or morecalculated penalty values. The method further includes displaying, tothe user via the electronic display associated with the electronicdevice, the determined plurality of preferred solutions, includingdisplaying, for one or more respective displayed solutions of thedetermined preferred solutions, an indication of one or more constraintsviolated by each respective displayed solution.

Another aspect relates to a method providing a technical solution to thetechnical problem of electronically determining preferred solutions tomulti-objective routing problems. The method includes receiving, at aserver, problem data for a routing problem comprising coordinates forone or more locations involved in the routing problem, and constraintdata defining one or more constraints for the routing problem and one ormore penalties associated with each constraint. The method furtherincludes electronically determining, utilizing the one or more locationsinvolved in the routing problem and the defined constraints andpenalties, a plurality of preferred solutions to the routing problem.Such electronic determining comprises generating a plurality ofpotential solutions to the routing problem, and calculating, for eachgenerated solution, an estimated amount of time for traversal of routesinvolved in that generated solution, a weighted time value based on thecalculated estimated amount of time for traversal of routes involved inthat generated solution, and an adjusted value involving a sum of thecalculated weighted time value for that generated solution and one ormore penalty values calculated based on evaluation of features of thatgenerated solution. Such electronic determining further comprisesdetermining the plurality of preferred solutions based on the calculatedadjusted values. The method further includes returning, from the server,data corresponding to the determined plurality of preferred solutions tothe routing problem.

In a feature of this aspect, returning, from the server, datacorresponding to the determined plurality of preferred solutions to therouting problem comprises returning the calculated estimated amount oftime for traversal of routes for each solution of the determinedplurality of preferred solutions.

In a feature of this aspect, electronically determining, utilizing theone or more locations involved in the routing problem and the definedconstraints and penalties, the plurality of preferred solutions to therouting problem comprises calculating, for each generated solution, anestimated total travel distance for that solution, and returning, fromthe server, data corresponding to the determined plurality of preferredsolutions to the routing problem comprises returning the calculatedestimated total travel distance for each solution of the determinedplurality of preferred solutions.

In a feature of this aspect, electronically determining, utilizing theone or more locations involved in the routing problem and the definedconstraints and penalties, the plurality of preferred solutions to therouting problem comprises calculating, for each generated solution, anestimated total fuel cost for that solution, and returning, from theserver, data corresponding to the determined plurality of preferredsolutions to the routing problem comprises returning the calculatedestimated total fuel cost for each solution of the determined pluralityof preferred solutions.

In a feature of this aspect, electronically determining, utilizing theone or more locations involved in the routing problem and the definedconstraints and penalties, the plurality of preferred solutions to therouting problem comprises calculating, for each generated solution, anestimated total labor cost for that solution, and returning, from theserver, data corresponding to the determined plurality of preferredsolutions to the routing problem comprises returning the calculatedestimated total labor cost for each solution of the determined pluralityof preferred solutions.

In a feature of this aspect, electronically determining, utilizing theone or more locations involved in the routing problem and the definedconstraints and penalties, the plurality of preferred solutions to therouting problem comprises calculating, for each generated solution, anestimated total cost for that solution, and returning, from the server,data corresponding to the determined plurality of preferred solutions tothe routing problem comprises returning the calculated estimated totalcost for each solution of the determined plurality of preferredsolutions.

One aspect relates to a method involving accelerating the electronicdetermination of optimized solutions to routing problems by leveragingsimplified travel time approximations. The method includes receiving, ata server, problem data for a routing problem comprising information forone or more locations involved in the routing problem; andelectronically populating a shortest path matrix with firstapproximation travel time estimates. Such electronic populatingcomprises calculating, for each respective possible pair of locationsinvolved in the routing problem, a respective first approximation traveltime estimate. Such calculating comprises calculating a respectivestraight line distance estimate between the respective pair oflocations, calculating a deformed distance value representingdeformation of the calculated respective straight line distance estimatebased on one or more curvature values, and calculating the respectivefirst approximation travel time estimate based on the deformed distancevalue. Such electronic populating further comprises populating an areaof the shortest path matrix corresponding to travel from a respectivefirst location of the respective possible pair of locations to arespective second location of the respective possible pair of locationswith the calculated respective first approximation travel time estimate,and populating an area of the shortest path matrix corresponding totravel from the respective second location of the respective possiblepair of locations to the respective first location of the respectivepossible pair of locations with the calculated respective firstapproximation travel time estimate. The method further includesbeginning to electronically determine one or more optimized solutions tothe routing problem using one or more of the calculated firstapproximation travel time estimates contained in the shortest pathmatrix, while concurrently, in parallel, electronically updating theshortest path matrix with second travel time estimates by calculating,for each of one or more respective ordered pairs of locations involvedin the routing problem, a respective second travel time estimate for ashortest path for travel from a respective first location of therespective ordered pair of locations to a respective second location ofthe respective ordered pair of locations, such calculated respectivesecond travel time estimate being calculated based on road network data,and updating an area of the shortest path matrix corresponding to travelfrom the respective first location of the respective ordered pair oflocations to the respective second location of the respective orderedpair of locations with the calculated respective second travel timeestimate. The method further includes completing electronicdetermination of a set of one or more optimized solutions to the routingproblem using one or more of the calculated second travel time estimatesaccessed from the shortest path matrix; and returning, from the server,data corresponding to the determined set of one or more optimizedsolutions to the routing problem. The use of first approximation traveltime estimates allows for more rapid beginning of a process forelectronically determining one or more optimized solutions to therouting problem as compared to having to wait for computation of secondtravel time estimates for every ordered pair of locations involved inthe routing problem, thus allowing for more rapid determination of thedetermined set of one or more optimized solutions.

In a feature of this aspect, the information for one or more locationsinvolved in the routing problem comprises coordinates for one or morelocations involved in the routing problem.

In a feature of this aspect, the information for one or more locationsinvolved in the routing problem comprises latitude and longitudecoordinates for one or more locations involved in the routing problem

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, suchcalculating comprises calculating the respective straight line distanceestimate between the respective pair of locations using the Haversineformula.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for an area of a road network.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for one or more road segments.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for an area of a road network proximatea location of the respective possible pair of locations.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for an area of a road network proximateboth locations of the respective possible pair of locations.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for an area of a road network locatedbetween the locations of the respective possible pair of locations.

In a feature of this aspect, with respect to calculating, for eachrespective possible pair of locations involved in the routing problem,the respective first approximation travel time estimate, calculating thedeformed distance value representing deformation of the calculatedrespective straight line distance estimate based on one or morecurvature values involves calculating the deformed distance value basedon one or more curviness values for an area of a road network proximateboth locations of the respective possible pair of locations and one ormore curviness values for an area of a road network located between thelocations of the respective possible pair of locations.

Another aspect relates to a method involving accelerating the electronicdetermination of optimized solutions to routing problems by leveragingsimplified travel time approximations. The method includes receiving, ata server, problem data for a routing problem comprising coordinates forone or more locations involved in the routing problem; andelectronically populating a first shortest path matrix with firstapproximation travel time estimates. Such electronically populating thefirst shortest path matrix comprises calculating, for each respectivepossible pair of locations involved in the routing problem, a respectivefirst approximation travel time estimate, such calculating comprisingcalculating a respective straight line distance estimate between therespective pair of locations, calculating a deformed distance valuerepresenting deformation of the calculated respective straight linedistance estimate based on one or more curvature values, and calculatingthe respective first approximation travel time estimate based on thedeformed distance value. Such electronically populating the firstshortest path matrix further comprises populating an area of the firstshortest path matrix corresponding to travel from a respective firstlocation of the respective possible pair of locations to a respectivesecond location of the respective possible pair of locations with thecalculated respective first approximation travel time estimate, andpopulating an area of the first shortest path matrix corresponding totravel from the respective second location of the respective possiblepair of locations to the respective first location of the respectivepossible pair of locations with the calculated respective firstapproximation travel time estimate. The method further comprisesbeginning to electronically determine one or more optimized solutions tothe routing problem using one or more of the calculated firstapproximation travel time estimates contained in the shortest pathmatrix, while concurrently, in parallel, electronically populating asecond shortest path matrix with second travel time estimates bycalculating, for each of one or more respective ordered pairs oflocations involved in the routing problem, a respective second traveltime estimate for a shortest path for travel from a respective firstlocation of the respective ordered pair of locations to a respectivesecond location of the respective ordered pair of locations, suchcalculated respective second travel time estimate being calculated basedon road network data, and populating an area of the second shortest pathmatrix corresponding to travel from the respective first location of therespective ordered pair of locations to the respective second locationof the respective ordered pair of locations with the calculatedrespective second travel time estimate. The method further comprisescompleting electronic determination of a set of one or more optimizedsolutions to the routing problem using one or more of the calculatedsecond travel time estimates accessed from the second shortest pathmatrix; and returning, from the server, data corresponding to thedetermined set of one or more optimized solutions to the routingproblem. The use of first approximation travel time estimates allows formore rapid beginning of a process for electronically determining one ormore optimized solutions to the routing problem as compared to having towait for computation of second travel time estimates for every orderedpair of locations involved in the routing problem, thus allowing formore rapid determination of the determined set of one or more optimizedsolutions.

One aspect relates to a method involving accelerating the electronicdetermination of optimized solutions to routing problems by utilizingdetermined optimal time windows for precomputing optimal path matricesto reduce computer resource usage. The method includes receiving, at aserver, problem data for a routing problem comprising information forone or more locations involved in the routing problem; electronicallyaccessing traffic data for a first set of road segments in one or moreareas of a road network encompassing the one or more locations, thetraffic data comprising speed information for travel along the roadsegments at various times of day; electronically calculating, based onthe accessed traffic data, data for a best fit line representing a bestfit for the accessed traffic data, the data for the best fit lineincluding, for each of various respective times of day, a respectivebest fit speed value for that respective time of day; electronicallydefining, based on the calculated data for the best fit line, aplurality of traffic windows each having a start time and an end timeduring a day, electronically defining the plurality of traffic windowscomprising electronically determining a plurality of inflection pointsrepresenting times of day at which a change in a rate of change of thebest fit line exceeds a minimum threshold, and electronically defining astart time and an end time for each traffic window of the plurality oftraffic windows based on the determined plurality of inflection points,each inflection point representing an end time for one traffic windowand a start time for another traffic window. The method further includeselectronically populating one or more shortest path matrices with traveltime estimates for each defined traffic window by, for each respectivedefined traffic window, calculating, for each of one or more respectiveordered pairs of locations involved in the routing problem, a respectivetravel time estimate for a shortest path for travel from a respectivefirst location of the respective ordered pair of locations to arespective second location of the respective ordered pair of locations,such calculated respective travel time estimate being calculated basedon road network data and traffic data for that respective definedtraffic window; electronically determining a set of one or moreoptimized solutions to the routing problem using a plurality of thecalculated travel time estimates accessed from the one or more shortestpath matrices; and returning, from the server, data corresponding to thedetermined set of one or more optimized solutions to the routingproblem. The use of traffic windows defined based on changes in rates ofchange of speeds for traffic on road segments allows for more rapiddetermination of the set of one or more optimized solutions as comparedto requiring on-demand, in-process determination of a shortest path fora particular time during comparison of paths or routes performed as partof a process for determining optimized solutions to the routing problem.

In a feature of this aspect, electronically determining a plurality ofinflection points representing times of day at which a change in a rateof change of the best fit line exceeds a minimum threshold comprisesapplying statistical methods to determine the plurality of inflectionpoints.

In a feature of this aspect, electronically determining a plurality ofinflection points representing times of day at which a change in a rateof change of the best fit line exceeds a minimum threshold comprisescalculating one or more second derivatives of the best fit line.

In a feature of this aspect, electronically defining a start time and anend time for each traffic window of the plurality of traffic windowsbased on the determined plurality of inflection points comprisesautomatically defining a start time for a first traffic window proximatea certain time of day.

In a feature of this aspect, electronically defining a start time and anend time for each traffic window of the plurality of traffic windowsbased on the determined plurality of inflection points comprisesautomatically defining a start time for a first traffic window proximatemidnight.

In a feature of this aspect, electronically defining a start time and anend time for each traffic window of the plurality of traffic windowsbased on the determined plurality of inflection points comprisesautomatically defining an end time for a last traffic window proximate acertain time of day.

In a feature of this aspect, electronically defining a start time and anend time for each traffic window of the plurality of traffic windowsbased on the determined plurality of inflection points comprisesautomatically defining an end time for a last traffic window proximatemidnight.

In a feature of this aspect, electronically defining a start time and anend time for each traffic window of the plurality of traffic windowsbased on the determined plurality of inflection points comprisesdefining a traffic window which overlaps from one day to a next day.

In a feature of this aspect, electronically populating one or moreshortest path matrices with travel time estimates for each definedtraffic window comprises electronically populating a different shortestpath matrix for each defined traffic window.

In a feature of this aspect, electronically populating one or moreshortest path matrices with travel time estimates for each definedtraffic window comprises electronically populating a single shortestpath matrix with travel time estimates for each defined traffic window.

Another aspect relates to a method involving accelerating the electronicdetermination of optimized solutions to routing problems by utilizingdetermined optimal time windows for precomputing optimal path matricesto reduce computer resource usage. The method includes receiving, at aserver, problem data for a routing problem comprising information forone or more locations involved in the routing problem; electronicallyaccessing traffic data for a first set of road segments in one or moreareas of a road network encompassing the one or more locations, thetraffic data comprising travel time information for travel along theroad segments at various times of day; electronically calculating, basedon the accessed traffic data, data for a best fit line representing abest fit for the accessed traffic data, the data for the best fit lineincluding, for each of various respective times of day, a respectivebest fit travel time value for that respective time of day; andelectronically defining, based on the calculated data for the best fitline, a plurality of traffic windows each having a start time and an endtime during a day, electronically defining the plurality of trafficwindows comprising electronically determining a plurality of inflectionpoints representing times of day at which a change in a rate of changeof the best fit line exceeds a minimum threshold, and electronicallydefining a start time and an end time for each traffic window of theplurality of traffic windows based on the determined plurality ofinflection points, each inflection point representing an end time forone traffic window and a start time for another traffic window. Themethod further includes electronically populating one or more shortestpath matrices with travel time estimates for each defined traffic windowby, for each respective defined traffic window, calculating, for each ofone or more respective ordered pairs of locations involved in therouting problem, a respective travel time estimate for a shortest pathfor travel from a respective first location of the respective orderedpair of locations to a respective second location of the respectiveordered pair of locations, such calculated respective travel timeestimate being calculated based on road network data and traffic datafor that respective defined traffic window; electronically determining aset of one or more optimized solutions to the routing problem using aplurality of the calculated travel time estimates accessed from the oneor more shortest path matrices; and returning, from the server, datacorresponding to the determined set of one or more optimized solutionsto the routing problem. The use of traffic windows defined based onchanges in rates of change of travel times for traffic on road segmentsallows for more rapid determination of the set of one or more optimizedsolutions as compared to requiring on-demand, in-process determinationof a shortest path for a particular time during comparison of paths orroutes performed as part of a process for determining optimizedsolutions to the routing problem.

Another aspect relates to a method involving accelerating the electronicdetermination of optimized solutions to routing problems by utilizingdetermined optimal time windows for precomputing optimal path matricesto reduce computer resource usage. The method includes receiving, at aserver, problem data for a routing problem comprising information forone or more locations involved in the routing problem; electronicallyaccessing traffic data for a first set of road segments in one or moreareas of a road network encompassing the one or more locations, thetraffic data comprising speed information for travel along the roadsegments at various times of day; and electronically defining, based onthe accessed traffic data for the first set of road segments, aplurality of traffic windows each having a start time and an end timeduring a day, electronically defining the plurality of traffic windowscomprising electronically applying statistical methods to the accessedtraffic data to determine a plurality of inflection points whichrepresent times of day at which a change in a rate of change of speedsexceeds a minimum threshold, and electronically defining a start timeand an end time for each traffic window of the plurality of trafficwindows based on the determined plurality of inflection points, eachinflection point representing an end time for one traffic window and astart time for another traffic window. The method further includeselectronically populating one or more shortest path matrices with traveltime estimates for each defined traffic window by, for each respectivedefined traffic window, calculating, for each of one or more respectiveordered pairs of locations involved in the routing problem, a respectivetravel time estimate for a shortest path for travel from a respectivefirst location of the respective ordered pair of locations to arespective second location of the respective ordered pair of locations,such calculated respective travel time estimate being calculated basedon road network data and traffic data for that respective definedtraffic window; electronically determining a set of one or moreoptimized solutions to the routing problem using a plurality of thecalculated travel time estimates accessed from the one or more shortestpath matrices; and returning, from the server, data corresponding to thedetermined set of one or more optimized solutions to the routingproblem. The use of traffic windows defined based on changes in rates ofchange of speeds for traffic on road segments allows for more rapiddetermination of the set of one or more optimized solutions as comparedto requiring on-demand, in-process determination of a shortest path fora particular time during comparison of paths or routes performed as partof a process for determining optimized solutions to the routing problem.

Another aspect relates to one or more non-transitory computer readablemedia containing computer executable instructions executable by one ormore processors for performing a disclosed method.

Another aspect relates to a system for performing a disclosed method.

In addition to the aforementioned aspects and features of the presentinvention, it should be noted that the present invention furtherencompasses the various logical combinations and subcombinations of suchaspects and features. Thus, for example, claims in this or a divisionalor continuing patent application or applications may be separatelydirected to any aspect, feature, or embodiment disclosed herein, orcombination thereof, without requiring any other aspect, feature, orembodiment.

BRIEF DESCRIPTION OF THE DRAWINGS

One or more preferred embodiments of the present invention now will bedescribed in detail with reference to the accompanying drawings, whereinthe same elements are referred to with the same reference numerals, andwherein:

FIG. 1 illustrates an exemplary graphical user interface for exemplarysoftware configured to provide solutions to routing problems;

FIG. 2 illustrates a portion of a road network from the graphical userinterface of FIG. 1;

FIG. 3 illustrates road segments from the graphical user interface ofFIG. 1;

FIG. 4 illustrates road segments connected at connections points;

FIG. 5 illustrates a road segment characterized by two end points;

FIG. 6 illustrates multiple road segments, each characterized by two endpoints;

FIG. 7 illustrates a table of road segments from FIG. 6 and theircorresponding distances;

FIG. 8 illustrates a first potential path between points F and C;

FIG. 9 illustrates a second potential path between points F and C;

FIG. 10 illustrates a third potential path between points F and C;

FIG. 11 illustrates a fourth potential path between points F and C;

FIG. 12 illustrates total distance summations for potential paths;

FIG. 13 illustrates a shortest path identification from the distancesummations;

FIG. 14 illustrates a flow for determining a shortest path;

FIG. 15 illustrates a table of estimated travel times based on speedlimits of the road segments;

FIG. 16 illustrates calculation of estimated travel times for potentialpaths;

FIG. 17 illustrates estimated travel times and total distances forpotential paths;

FIG. 18 fancifully illustrates determination of a preferred path;

FIG. 19 fancifully illustrates determination of a preferred path usingestimated travel times and a number of turns;

FIGS. 20-24 illustrate calculation of total estimated travel time forthe paths of FIGS. 8-11, updated to account for turning time;

FIGS. 25-29 illustrate calculation of total estimated travel time forthe paths of FIGS. 8-11, updated to account for time at various types ofintersections and turning time;

FIG. 30 illustrates exemplary storage of historical data for traversalof road segments;

FIG. 31 illustrates exemplary average travel time values calculated forroad segments based on historical data;

FIG. 32 illustrates exemplary average historical travel time valuescalculated for navigation from one road segment to another;

FIG. 33-34 illustrate exemplary average travel times for windows of timethroughout a day;

FIG. 35 fancifully illustrates a directional road segment;

FIG. 36 fancifully illustrates another directional road segment;

FIG. 37 fancifully illustrates two directional road segments going inopposite directions;

FIG. 38 illustrates exemplary travel times for the road segmentsillustrated in FIG. 37;

FIG. 39 illustrates a more granular road segmentation;

FIG. 40 illustrates a calculation of a preference value for a pathutilizing a distance weight and a time weight;

FIG. 41 illustrates a calculation of such a preference value for eachpotential path of FIGS. 8-11;

FIG. 42 illustrates a calculation of normalized time and distancevalues, and a preference value;

FIG. 43 illustrates exemplary C Sharp style pseudocode for calculationof a preference value based on normalized time and distance values;

FIG. 44 illustrates exemplary storage of data for a road segment whichincludes latitude and longitude coordinates;

FIG. 45 illustrates the use of an assigned unique identifier for a roadsegment;

FIG. 46 illustrates data stored for a road segment including a list ofconnections from the road segment to and from other road segments;

FIG. 47 illustrates stored data for a road segment which includes endpoints of the road segment as well as a list of points along the roadsegment;

FIG. 48 illustrates an exemplary graphical user interface with a startlocation and a destination location;

FIG. 49 illustrates points along road segments;

FIG. 50 illustrates an exemplary graphical user interface with markersindicating locations to be visited;

FIG. 51 illustrates a simple two-dimensional grid for distance valuesfor shortest paths between each location;

FIG. 52 illustrates a grid for an exemplary scenario in which thedistance between any location and itself would be zero;

FIG. 53 illustrates a first potential path between two locations;

FIG. 54 illustrates a second potential path between the two points ofFIG. 53;

FIG. 55 illustrates calculation of total distance values for each pathin FIG. 53 and FIG. 54;

FIG. 56 illustrates the identification of a shortest distance path;

FIGS. 57-58 illustrate the population of a shortest distance path valuein the grid of FIG. 51;

FIG. 59 illustrates the population of all shortest distance path valuesin the grid of FIG. 51;

FIG. 60 illustrates a simple two-dimensional grid for estimated timevalues for shortest paths between each location;

FIGS. 61-62 illustrate a first and second potential path between twolocations and the estimated travel time;

FIG. 63 illustrates the identification of the shortest travel time fromFIGS. 61-62;

FIG. 64 illustrates the population of a shortest travel time in the gridof FIG. 60;

FIG. 65 illustrates a first potential path between the two locations ofFIGS. 61-62 in the opposite direction and the estimated travel time;

FIG. 66 illustrates the population of a shortest travel time in the gridof FIG. 60;

FIG. 67 illustrates the population of all shortest travel times in thegrid of FIG. 60;

FIG. 68 illustrates the shortest distance and shortest travel timesstored in a matrix together;

FIG. 69 illustrates a matrix with travel times and distances formultiple time windows each corresponding to an hour of a twenty fourhour day;

FIGS. 70-73 illustrate four potential routes visiting all four locationsillustrated in FIG. 50;

FIG. 74 illustrates identification of a preferred route;

FIG. 75 illustrates three potential assignments of trucks for a routingproblem;

FIGS. 76-77 fancifully illustrate determination of an estimated traveltime for a first potential assignment of two trucks;

FIG. 78 fancifully illustrates determination of an estimated travel timefor a second potential assignment of two trucks;

FIG. 79 fancifully illustrates determination of an estimated travel timefor a third potential assignment of two trucks;

FIG. 80 fancifully illustrates comparison of estimated travel times fordifferent potential assignments of two trucks;

FIG. 81 illustrates three potential assignments of trucks for solutionof another routing problem;

FIGS. 82-84 fancifully illustrate determination of an estimated traveltime for first, second, and third potential assignments of two trucks;

FIG. 85 fancifully illustrates determination of an estimated travel timefor a third potential assignment of two trucks;

FIG. 86 illustrates weighting of an estimated time value for anassignment;

FIG. 87 illustrates calculation of weighted estimated time values forpotential assignments;

FIG. 88 illustrates calculation of a normalized value for an estimatedvalue for an assignment;

FIG. 89 illustrates calculation of normalized estimated time values forpotential assignments;

FIG. 90 fancifully illustrates calculation of a curviness value for aroad segment;

FIGS. 91-92 illustrate an exemplary user interface for specifyingconstraints and penalties for a routing problem;

FIGS. 93A-C fancifully illustrate approaches for the calculation ofpenalty values and adjusted values taking such penalty values intoaccount;

FIG. 94 fancifully illustrates penalty points for various routes;

FIG. 95 illustrates adjusted values calculated for potential solutionsby adding calculated penalty values to normalized estimated values;

FIGS. 96A-D illustrate one or more exemplary methodologies forgenerating high quality solutions to a routing problem;

FIG. 97 illustrates an exemplary user interface presenting multiplesolutions to a routing problem where a user is allowed to select fromthe presented solutions;

FIG. 98 illustrates calculation of an adjusted value for variouspotential paths during determination of a preferred or optimized route;

FIGS. 99-101 illustrate three potential assignments together withcalculated total adjusted values for routes under each assignment;

FIG. 102A illustrates the identification of a preferred or optimizedassignment using calculated adjusted values;

FIG. 102B illustrates the identification of a preferred or optimizedsolution;

FIG. 103 illustrates penalty values being utilized to calculate adjustedvalues for road segments or path portions during path evaluation;

FIG. 104 illustrates a calculated Euclidean distance estimate for travelbetween two points;

FIG. 105 illustrates the estimate from FIG. 104 stored in a shortestpath matrix;

FIG. 106 illustrates a calculated Euclidean distance estimate for travelbetween two points;

FIG. 107 illustrates the estimate from FIG. 106 stored in the sameshortest path matrix from FIG. 105;

FIG. 108 illustrates population of the shortest path matrix of FIG. 105;

FIG. 109 illustrates population of estimated time values in a shortestpath matrix;

FIGS. 110-111 illustrate first and second potential routes anddetermined estimated travel times;

FIG. 112 fancifully illustrates identification of a preferred oroptimized route;

FIG. 113 illustrates updating the shortest path matrix of FIG. 109 witha computed value;

FIGS. 114-116 illustrate three potential assignments for two trucks;

FIG. 117 fancifully illustrates comparison of potential assignments;

FIG. 118 illustrate use of updated computed values in a shortest pathmatrix;

FIG. 119 further illustrates use of updated computed values in theshortest path matrix;

FIG. 120 illustrates calculation of an estimated travel time, based oncomputed values, for an assignment that was previously determined, basedon estimated values, to be preferred or optimized;

FIG. 121 fancifully illustrates computed accurate shortest path valuesfor paths determined to be part of a preferred or optimized assignment;

FIG. 122 illustrates exemplary calculation of a deformed Euclideandistance estimate;

FIG. 123 illustrates plotting of a normalized average travel time totraverse a particular road segment throughout the day;

FIG. 124 illustrates plotting of a normalized average speed for aparticular road segment throughout the day;

FIG. 125 illustrates plotting of a normalized average travel time totraverse a specific road segment during each of twenty four one hourwindows throughout the day;

FIG. 126 illustrates plotting of normalized average travel times totraverse three specific road segments throughout the day;

FIG. 127 illustrates exemplary C Sharp style pseudocode for calculationof a best fit line based on normalized average travel time valuesthroughout the day;

FIG. 128 illustrates calculation of a best fit average travel time valuefor a simplified best fit line for a specific window of time;

FIG. 129 illustrates the plotting of a best fit average travel timevalue for a simplified best fit line for a window of time;

FIG. 130 illustrates plotting of similarly calculated best fit averagetravel time values for a simplified best fit line for other windows oftime;

FIG. 131 illustrates how the values of FIG. 130 can be characterized asforming a best fit line;

FIG. 132 illustrates simplified calculation of a second order deltarepresenting a change in the rate of change at a specific time interval;

FIG. 133 illustrates comparison of the calculated second order delta ofFIG. 132 to a threshold value;

FIG. 134 fancifully illustrates that it has been determined that acorresponding time interval should be used as a cutoff to define atraffic window;

FIG. 135 fancifully illustrates additional time intervals used ascutoffs to define a traffic window;

FIG. 136 illustrates the cutoffs in FIG. 135 used to define a pluralityof traffic windows;

FIG. 137 illustrates exemplary C Sharp style pseudocode for simplifieddetermination of times to be utilized for definition of traffic windows;

FIG. 138 illustrates a matrix containing calculated values for shortestor preferred paths for traffic windows of FIG. 136;

FIG. 139 illustrates an exemplary geographic area comprising a roadnetwork;

FIG. 140 illustrates a requestor communicating a request related to arouting problem involving specific locations;

FIG. 141 fancifully illustrates characterization of the state of NorthCarolina as a zone;

FIG. 142 fancifully illustrates that a zone may have a designatedserver;

FIG. 143 fancifully illustrates characterization of the state of Floridaas a zone;

FIG. 144 illustrates provision of a server including data for a zonecorresponding to Florida;

FIG. 145 illustrates that a single server may include data for two ormore zones;

FIGS. 146-152 fancifully illustrate that multiple zones may overlap orbe nested inside of one another;

FIG. 153 illustrates a server comprising a geo-locator service whichcontains information regarding defined zones;

FIG. 154 fancifully illustrates three locations involved in a routingproblem;

FIG. 155-158 fancifully illustrate a methodology in which a geo-locatorservice is utilized to allow a requestor to determine what server tocontact to receive information for a routing problem;

FIGS. 159-160 illustrate another example of determination of a smallestdefined zone containing all of the locations involved in a routingproblem.

DETAILED DESCRIPTION

As a preliminary matter, it will readily be understood by one havingordinary skill in the relevant art (“Ordinary Artisan”) that theinvention has broad utility and application. Furthermore, any embodimentdiscussed and identified as being “preferred” is considered to be partof a best mode contemplated for carrying out the invention. Otherembodiments also may be discussed for additional illustrative purposesin providing a full and enabling disclosure of the invention.Furthermore, an embodiment of the invention may incorporate only one ora plurality of the aspects of the invention disclosed herein; only oneor a plurality of the features disclosed herein; or combination thereof.As such, many embodiments are implicitly disclosed herein and fallwithin the scope of what is regarded as the invention.

Accordingly, while the invention is described herein in detail inrelation to one or more embodiments, it is to be understood that thisdisclosure is illustrative and exemplary of the invention and is mademerely for the purposes of providing a full and enabling disclosure ofthe invention. The detailed disclosure herein of one or more embodimentsis not intended, nor is to be construed, to limit the scope of patentprotection afforded the invention in any claim of a patent issuing herefrom, which scope is to be defined by the claims and the equivalentsthereof. It is not intended that the scope of patent protection affordedthe invention be defined by reading into any claim a limitation foundherein that does not explicitly appear in the claim itself.

Thus, for example, any sequence(s) and/or temporal order of steps ofvarious processes or methods that are described herein are illustrativeand not restrictive. Accordingly, it should be understood that, althoughsteps of various processes or methods may be shown and described asbeing in a sequence or temporal order, the steps of any such processesor methods are not limited to being carried out in any particularsequence or order, absent an indication otherwise. Indeed, the steps insuch processes or methods generally may be carried out in variousdifferent sequences and orders while still falling within the scope ofthe invention. Accordingly, it is intended that the scope of patentprotection afforded the invention be defined by the issued claim(s)rather than the description set forth herein.

Additionally, it is important to note that each term used herein refersto that which the Ordinary Artisan would understand such term to meanbased on the contextual use of such term herein. To the extent that themeaning of a term used herein—as understood by the Ordinary Artisanbased on the contextual use of such term—differs in any way from anyparticular dictionary definition of such term, it is intended that themeaning of the term as understood by the Ordinary Artisan shouldprevail.

With regard solely to construction of any claim with respect to theUnited States, no claim element is to be interpreted under 35 U.S.C.112(f) unless the explicit phrase “means for” or “step for” is actuallyused in such claim element, whereupon this statutory provision isintended to and should apply in the interpretation of such claimelement. With regard to any method claim including a condition precedentstep, such method requires the condition precedent to be met and thestep to be performed at least once during performance of the claimedmethod.

Furthermore, it is important to note that, as used herein, “comprising”is open-ended insofar as that which follows such term is not exclusive.Additionally, “a” and “an” each generally denotes “at least one” butdoes not exclude a plurality unless the contextual use dictatesotherwise. Thus, reference to “a picnic basket having an apple” is thesame as “a picnic basket comprising an apple” and “a picnic basketincluding an apple”, each of which identically describes “a picnicbasket having at least one apple” as well as “a picnic basket havingapples”; the picnic basket further may contain one or more other itemsbeside an apple. In contrast, reference to “a picnic basket having asingle apple” describes “a picnic basket having only one apple”; thepicnic basket further may contain one or more other items beside anapple. In contrast, “a picnic basket consisting of an apple” has only asingle item contained therein, i.e., one apple; the picnic basketcontains no other item.

When used herein to join a list of items, “or” denotes “at least one ofthe items” but does not exclude a plurality of items of the list. Thus,reference to “a picnic basket having cheese or crackers” describes “apicnic basket having cheese without crackers”, “a picnic basket havingcrackers without cheese”, and “a picnic basket having both cheese andcrackers”; the picnic basket further may contain one or more other itemsbeside cheese and crackers.

When used herein to join a list of items, “and” denotes “all of theitems of the list”. Thus, reference to “a picnic basket having cheeseand crackers” describes “a picnic basket having cheese, wherein thepicnic basket further has crackers”, as well as describes “a picnicbasket having crackers, wherein the picnic basket further has cheese”;the picnic basket further may contain one or more other items besidecheese and crackers.

The phrase “at least one” followed by a list of items joined by “and”denotes an item of the list but does not require every item of the list.Thus, “at least one of an apple and an orange” encompasses the followingmutually exclusive scenarios: there is an apple but no orange; there isan orange but no apple; and there is both an apple and an orange. Inthese scenarios if there is an apple, there may be more than one apple,and if there is an orange, there may be more than one orange. Moreover,the phrase “one or more” followed by a list of items joined by “and” isthe equivalent of “at least one” followed by the list of items joined by“and”.

Referring now to the drawings, one or more preferred embodiments of theinvention are next described. The following description of one or morepreferred embodiments is merely exemplary in nature and is in no wayintended to limit the invention, its implementations, or uses.

INTRODUCTION

FIG. 1 illustrates an exemplary graphical user interface for exemplarysoftware which is configured to provide solutions to routing problems.The graphical user interface comprises a map with a first placementmarker 102 indicating a start location and second placement marker 104indicating a desired destination location.

The graphical user interface is displaying a portion of a road network,which can be more clearly seen in FIG. 2. The road network can becharacterized as being made up of road segments, as fancifullyillustrated in FIG. 3, in which exemplary road segments 112,114 arecalled out. The road segments can be characterized as being connected toone another at connections points, as fancifully illustrated in FIG. 4,where exemplary road segments 112,114 are fancifully illustrated asconnected at connection point 116. A road segment can be characterizedby its end points, as illustrated in FIG. 5, where point 116 ischaracterized as point A, point 118 is characterized as point B, androad segment 112 is characterized as road segment AB. FIG. 6 illustratessimilar characterization of other road segments of the illustrated roadnetwork.

A distance of each of these road segments can be determined and stored,as illustrated in FIG. 7. Based on these distances, a total distance ofa path from one point to another can be determined. Further, determineddistances for various possible paths can be compared to determine anoptimal path.

For example, with reference to points F and C illustrated in FIG. 6,FIG. 8 illustrates a first potential path between points F and C whichincludes road segments BF, AB, and AC, FIG. 9 illustrates a secondpotential path between points F and C which includes road segments BF,AB, AD, and AC, FIG. 10 illustrates a third potential path betweenpoints F and C which includes road segments BF, BE, DE, and CD, and FIG.11 illustrates a fourth potential path between points F and C whichincludes road segments BF, BE, DE, AD, and AC. It will be appreciatedthat more or less paths may be identified. For example, a search forpaths between two points may involve a breadth first or depth firsttraversal of connecting road segments in an attempt to determine one ormore paths from a first point to a second point.

A total distance for each path can be determined by summing up thedistances of each road segment that the path traverses, as illustratedin FIG. 12. A shortest path can be identified based on these determinedtotal distances, as illustrated in FIG. 13.

Thus, an exemplary process for determining a shortest path can involvedetermining one or more potential paths, calculating one or more values(e.g. a total distance) for each potential path, and then determining ashortest path based on the calculated values. FIG. 14 illustrates a flowfor such an exemplary process.

Notably, however, other methodologies and approaches may additionally oralternatively be utilized for determining a shortest or preferred pathbetween two points. For example, a search for a shortest or preferredpath between two points may involve a breadth first traversal ofconnecting road segments in an attempt to determine a shortest orpreferred path from a first point to a second point.

It will be appreciated that determination of a preferred path mayinvolve not just determination of a path having a shortest totaldistance, but also may involve determination of a path having a shortestestimated travel time.

For example, an estimated travel time for road segments could becalculated based on speed limits of the road segments, as illustrated inFIG. 15, and these estimated travel times could then be utilized tocalculate estimated travel times for paths traversing such roadsegments. FIG. 16 illustrates calculation of estimated travel times forthe paths of FIGS. 8-11.

In some instances, both a determined estimated travel time for a pathand a determined total distance for a path may be utilized to select apreferred or shortest path. For example, as illustrated in FIG. 17,three of the four potential paths of FIGS. 8-11 have all been determinedto have the same total estimated travel time. Determination of apreferred or shortest path might involve first determining one or morepaths having a shortest total estimated travel time, and then using adetermined total distance as a further metric to select a preferred orshortest path from among any that have the same (or very similar) totalestimated travel time, as illustrated in FIG. 18.

Other criteria could be utilized as well. For example, FIG. 19illustrates use of a number of turns as a further metric to select apreferred or shortest path from among any that have the same (or verysimilar) total estimated travel time.

Additionally or alternatively, required turns along a traversed path maybe taken into account in calculating an estimated travel time for apath. For example, FIGS. 20-24 illustrate calculation of total estimatedtravel times for the paths of FIGS. 8-11, updated to add 30 seconds foreach required left turn and 10 seconds for each required right turn.

It will be appreciated that the values of 30 seconds and 10 seconds arejust exemplary values. Further, more less different values could beutilized for different navigation scenarios (e.g. turns) along a path.For example, FIGS. 25-29 illustrate calculation of total estimatedtravel times for the paths of FIGS. 8-11, updated to add 15 seconds forgoing straight at an intersection without a light, 20 seconds for goingstraight at an intersection with a light, 30 seconds for a left turn atan intersection with a light, 20 seconds for a left turn at anintersection without a light, and 10 seconds for a right turn at anintersection with a light.

Moreover, rather than simply being calculated based on speed limits of aroad segment, an estimated travel time for a road segment may bedetermined based on historical data for vehicles that traversed thatroad segment. For example, global positioning system (GPS) data may begathered from vehicles with a GPS device traveling on a road segment.FIG. 30 illustrates exemplary storage of historical data for traversalof road segments.

FIG. 31 illustrates exemplary average travel time values calculated forroad segments based on gathered historical data for traversal of suchroad segments.

Similarly, historical data can be gathered on the time it takes vehiclesto navigate from one road segment to another (e.g. turn at anintersection), and utilized to determine an estimated travel time forsuch navigations.

FIG. 32 illustrates exemplary average travel time values calculated fornavigation from one road segment to another based on gathered historicaldata for such navigations.

It will be appreciated that traffic patterns may frequently allow forquicker traversal of a road segment (or navigation from one road segmentto another) at certain times of the day, and slower traversal at othertimes. To account for this, exemplary average travel times may bedetermined for windows throughout the day, e.g. for 24 one hour windows,as illustrated in FIGS. 33-34.

Determination of a shortest path may involve utilizing the timeestimates for a window within which a current time falls, or withinwhich an estimated time of travel falls.

It will further be appreciated that it may frequently take longer orshorter to traverse a road in a first direction, as compared to theopposite direction. In this regard, a two way road between two pointscan be characterized as representing not just one road segment, but tworoad segments (one in each direction). For example, FIG. 35 illustratesroad segment AB from point 116 to point 118, and FIG. 36 illustratesroad segment BA from point 118 to point 116. FIG. 37 illustrates both ofthese road segments together, and FIG. 38 illustrates different averagetravel times for each of these road segments.

Although thus far road segments have largely been described as a segmentconnecting two intersections, it will be appreciated that more or lessgranular road segments may be defined and utilized. For example, FIG. 39illustrates more granular road segmentation.

As noted above, determination of a preferred path may involve not justdetermination of a path having a shortest total distance, but also mayinvolve determination of a path having a shortest estimated travel time.Determination of a preferred path may for example involve calculation ofa preference value for a path utilizing a distance weight for a totaldistance of the path and a time weight for an estimated travel time forthe path, as illustrated in FIG. 40. FIG. 41 is a fanciful illustrationof calculation of such a preference value for each potential path ofFIGS. 8-11.

Determination of a preferred path may also involve calculation of apreference value based on normalized time and distance values. Forexample, a normalized time value may be generated by dividing each totalestimated time amount by a minimum total estimated time amount (or bydividing a minimum total estimated time amount by each total estimatedtime amount), and a normalized distance value may be generated bydividing each total distance amount by a minimum total distance amount(or by dividing a minimum total distance amount by each total distanceamount). FIG. 42 is a fanciful illustration of calculation of normalizedtime and distance values, and a preference value based on suchnormalized time and distance values. FIG. 43 illustrates exemplary CSharp style pseudocode for calculation of such a preference value basedon normalized time and distance values.

It will be appreciated that stylized, simplified examples are describedherein in a fanciful manner for purposes of clarity of description.Actual implementations will generally involve more complexity.

For example, FIG. 44 illustrates exemplary storage of data for a roadsegment which includes latitude and longitude coordinates for abeginning of a road segment, and latitude and longitude coordinates foran end of the road segment. Although the example of FIG. 44 involves useof an identifier for a road segment which comprises an identifier foreach of two end points of the road segment, a road segment may insteadinclude an assigned unique identifier, as illustrated in FIG. 45.

Data stored for a road segment may include a list of joins orconnections from the road segment to other road segments, as well as alist of joins or connections to the road segment from other roadsegments, as illustrated in FIG. 46. Stored data for such a join orconnection may include an indication of a joined or connected streetsegment, an indication of a type of join or connection, and anindication of coordinates at which the join or connection occurs, asillustrated in FIG. 46.

It will be appreciated that many roads are not straight. Stored data fora road segment may include both a traversal length of the road segment,as well as a “crow flies” distance between ends of the road segment(e.g. a Euclidean distance or a distance calculated via the Haversineformula). Further, stored data for a road segment may include not justcoordinates for end points of a road segment, but a list of points alonga length of the road segment, as illustrated in FIG. 47.

It will be appreciated that in determining a shortest or preferred pathbetween two locations, those two locations will not always fall at anend of a road segment. For example FIG. 48 illustrates an exemplarygraphical user interface comprising a map with a first placement marker106 indicating a start location and second placement marker 108indicating a desired destination location. Stored data regarding pointsalong road segments enables determination of what road segment theplacement marker 106 lies on (or is closest to), as well asdetermination of a distance from that point to an end of that roadsegment. FIG. 49 illustrates this in a fanciful manner.

Precomputing Shortest Path Matrices

It will be appreciated that it can be useful to determine not only theshortest path between two locations, but also a preferred or optimizedroute for visiting multiple locations. For example, FIG. 50 illustratesan exemplary graphical user interface comprising a map with placementmarkers 202 indicating locations to be visited. These can representlocations for use in a routing problem, in which a high quality routingsolution is to be determined which involves visiting of all of thespecified locations.

In accordance with one or more preferred implementations, determinationof a routing solution to a routing problem involves precomputation ofinformation regarding shortest or optimal paths between locations to bevisited for the routing problem. This information can be stored in oneor more matrices, which can be characterized as shortest path matrices.

For example, FIG. 51 illustrates a simple two-dimensional grid fordistance values for shortest paths between each location.

As illustrated in FIG. 52, the distance between any location and itself(e.g. From “1” to “1”) would be zero.

Other distance values for each square can be determined based on adetermined shortest path, e.g. as described hereinabove.

As an example, consider travel from location “1” to location “2”. Asillustrated in FIG. 53, a first potential path would involve traversingroad segments BF and BE. Similarly, as illustrated in FIG. 54, a secondpotential path would involve traversing road segments BF, AB, AD, andDE. As noted above, other paths could be considered as well, or anothermethodology could be utilized to determine a shortest path (andcorresponding distance).

FIG. 55 illustrates calculation of total distance values for each ofthese paths, and FIG. 56 illustrates identification of the value “429”as the calculated total distance value for the determined shortest pathfor traversal from location “1” to location “2”.

This calculated total distance value for the determined shortest pathfor traversal from location “1” to location “2” can be stored as aprecalculated value in a travel distance matrix, as illustrated in FIG.57. In this simplistic example, all of the road segments arecharacterized as bidirectional road segments having the same traveldistance in both directions, so a distance value for the shortest pathfrom location “1” to location “2” would be the same as a distance valuefor the shortest path from location “2” to location “1”, as illustratedin FIG. 58.

A shortest path, and distance value therefore, can similarly bedetermined for traveling from each location to each other location, asillustrated in FIG. 59.

Further, an estimated time value can similarly be calculated for ashortest path between each location. For example, FIG. 60 illustrates asimple two-dimensional grid for estimated time values for shortest pathsbetween each location.

Just like calculated total distance values, estimated time values foreach square can be calculated based on a determined shortest path, e.g.as described hereinabove.

As an example, again consider travel from location “1” to location “2”,this time using directional road segments (e.g. where travel from A to Bin a first direction along road segment AB might have a first estimatedtravel time and travel from B to A in a second, opposite direction alongroad segment BA might have a second estimated travel time which may be,but does not have to be, different from the first estimated traveltime).

FIG. 61 illustrates a first potential path involving traversing roadsegments BF and BE, and calculation of an estimated travel time of 30seconds. Similarly, FIG. 62 illustrates a second potential pathinvolving traversing road segments FB, BA, AD, and DE, and calculationof an estimated travel time of 99 seconds. As noted above, other pathscould be considered as well. A shortest path could be determined to bethe shortest based on having a lowest estimated travel time. Anothermethodology could be utilized to determine a shortest path (andestimated travel time).

FIG. 63 illustrates identification of thirty seconds as the calculatedtotal estimated travel time value for the determined shortest path fortraversal from location “1” to location “2”.

This calculated total estimated travel time value for the determinedshortest path for traversal from location “1” to location “2” can bestored as a precalculated value in a travel time matrix, as illustratedin FIG. 64. Unlike the previous example, it cannot necessarily beassumed that the same total estimated travel time for a shortest pathwill hold for traversal from location “2” to location “1”.

Thus, it necessary to also consider travel from location “2” to location“1”.

FIG. 65 illustrates a first potential path involving traversing roadsegments EB and BF, and calculation of an estimated travel time of 21seconds. This estimated travel time of 21 seconds can be determined tobe the estimated travel time for the shortest path from location “2” tolocation “1”, and can be stored as a precalculated value in a traveltime matrix, as illustrated in FIG. 66.

A shortest path, and estimated travel time value therefore, cansimilarly be determined for traveling from each location to each otherlocation, as illustrated in FIG. 67.

These calculated estimated travel time values can even be stored in amatrix together with calculated distance values, as illustrated in FIG.68.

As noted above, it will be appreciated that traffic patterns mayfrequently allow for quicker traversal of a road segment (or navigationfrom one road segment to another) at certain times of the day, andslower traversal at other times. As described above, to account forthis, exemplary average travel times may be determined for windowsthroughout the day, e.g. for 24 one hour windows, as illustrated inFIGS. 33-34, and determination of a shortest path may involve utilizingthe time estimates for a window within which a current time falls, orwithin which an estimated time of travel falls.

Similarly, a matrix containing calculated values for determined shortestpaths may be precomputed and stored for time windows throughout the day,e.g. for 24 one hour windows, as illustrated in FIG. 69.

Determining High Quality Routes Utilizing Precomputed Shortest PathMatrices

As noted above, it will be appreciated that it can be useful todetermine not only the shortest path between two locations, but also apreferred or optimized route for visiting multiple locations. These canrepresent locations for use in a routing problem, in which one or morepreferred or optimized routing solutions are to be determined whichinvolve visiting of all of the specified locations. In accordance withone or more preferred implementations, one or more optimized routes maybe determined which represent part of a high quality routing solution.In accordance with one or more preferred implementations, one or moreoptimized routing solutions may be determined which represent highquality routing solutions, even if they have not been determined orconfirmed to be an optimal routing solution.

Returning to the example of FIG. 50, an exemplary approach todetermining a high quality routing solution for visiting all fourlocations will now be outlined utilizing the calculated travel times inthe precomputed shortest path matrix of FIG. 67.

FIG. 70 illustrates a first potential route visiting all four locationswhich involves traversal from location “1” to location “2”, traversalfrom location “2” to location “3”, and traversal from location “3” tolocation “4”. A total estimated travel time for this route can bedetermined utilizing the precalculated shortest estimated travel timesfor shortest paths between these locations in the precomputed shortestpath matrix. Thus, the route portion representing traversal fromlocation “1” to location “2” can be determined based on the precomputedshortest path matrix to have an estimated travel time of 30 seconds, theroute portion representing traversal from location “2” to location “3”can be determined based on the precomputed shortest path matrix to havean estimated travel time of 23 seconds, and the route portionrepresenting traversal from location “3” to location “4” can bedetermined based on the precomputed shortest path matrix to have anestimated travel time of 24 seconds. A total estimated travel time forthe route can be calculated by summing together these estimated traveltimes for these route portions. This results in a total estimated traveltime for the first potential route of 77 seconds, as illustrated in FIG.70.

FIG. 71 illustrates a second potential route visiting all four locationswhich involves traversal from location “1” to location “3”, traversalfrom location “3” to location “4”, and traversal from location “4” tolocation “2”. The route portion representing traversal from location “1”to location “3” can be determined based on the precomputed shortest pathmatrix to have an estimated travel time of 24 seconds, the route portionrepresenting traversal from location “3” to location “4” can bedetermined based on the precomputed shortest path matrix to have anestimated travel time of 24 seconds, and the route portion representingtraversal from location “4” to location “2” can be determined based onthe precomputed shortest path matrix to have an estimated travel time of28 seconds. These calculated estimated travel times for the routeportions can be summed together to result in a total estimated traveltime for the second potential route of 76 seconds, as illustrated inFIG. 71.

FIG. 72 illustrates a third potential route visiting all four locationswhich involves traversal from location “4” to location “3”, traversalfrom location “3” to location “2”, and traversal from location “2” tolocation “1”. The route portion representing traversal from location “4”to location “3” can be determined based on the precomputed shortest pathmatrix to have an estimated travel time of 24 seconds, the route portionrepresenting traversal from location “3” to location “2” can bedetermined based on the precomputed shortest path matrix to have anestimated travel time of 45 seconds, and the route portion representingtraversal from location “2” to location “1” can be determined based onthe precomputed shortest path matrix to have an estimated travel time of21 seconds. These calculated estimated travel times for the routeportions can be summed together to result in a total estimated traveltime for the third potential route of 90 seconds, as illustrated in FIG.72.

FIG. 73 illustrates a fourth potential route visiting all four locationswhich involves traversal from location “2” to location “4”, traversalfrom location “4” to location “3”, and traversal from location “3” tolocation “1”. The route portion representing traversal from location “2”to location “4” can be determined based on the precomputed shortest pathmatrix to have an estimated travel time of 28 seconds, the route portionrepresenting traversal from location “4” to location “3” can bedetermined based on the precomputed shortest path matrix to have anestimated travel time of 24 seconds, and the route portion representingtraversal from location “3” to location “1” can be determined based onthe precomputed shortest path matrix to have an estimated travel time of28 seconds. These calculated estimated travel times for the routeportions can be summed together to result in a total estimated traveltime for the fourth potential route of 90 seconds, as illustrated inFIG. 73.

A preferred or optimized route can be identified based on the calculatedtotal estimated travel times for each potential route, as illustrated inFIG. 74.

It will be appreciated that more or less paths may be identified. Forexample, a search for routes may involve a breadth first or depth firsttraversal of paths in an attempt to determine one or more paths.

Further, other methodologies and approaches may additionally oralternatively be utilized for determining a shortest, optimized, orpreferred route. For example, a search for a shortest, optimized, orpreferred route may involve one or more breadth first traversals ofpaths in an attempt to determine a shortest, optimized, or preferredroute, e.g. a depth first traversal from each of one or more locationsidentified as being geographically exterior to other locations.

It will be appreciated that routing problems can take various forms. Forexample, a routing problem may involve determining an optimized routefor not just one vehicle, but two or more vehicles, e.g. a fleet ofvehicles.

Returning again to the locations illustrated in FIG. 50, consider such arouting problem in which two trucks are to visit the four locations(assuming that each truck is to visit two of the locations). FIG. 75illustrates potential assignments of the trucks for solution of therouting problem. An exemplary approach to determining preferred oroptimized assignments for a high quality routing solution will now beoutlined utilizing the calculated travel times in the precomputedshortest path matrix of FIG. 67.

FIG. 76 illustrates a first potential assignment for two trucks. Thisfirst potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“2”, or a second potential route involving traversal from location “2”to location “1”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the precalculatedshortest estimated travel times for shortest paths between theselocations in the precomputed shortest path matrix. Thus, the routeinvolving traversal from location “1” to location “2” can be determinedbased on the precomputed shortest path matrix to have a total estimatedtravel time of 30 seconds, and the route involving traversal fromlocation “2” to location “1” can be determined based on the precomputedshortest path matrix to have a total estimated travel time of 21seconds.

This first potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“3” to location “4”, or a second potential route involving traversalfrom location “4” to location “3”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe precalculated shortest estimated travel times for shortest pathsbetween these locations in the precomputed shortest path matrix. Thus,the route involving traversal from location “3” to location “4” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 24 seconds, and the route involving traversalfrom location “4” to location “3” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 24 seconds.

A total estimated travel time for this first potential assignment can bedetermined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIGS. 76-77. Here, a totalestimated travel time for this first potential assignment can becalculated to be 45 seconds, as illustrated in FIG. 77.

FIG. 78 illustrates a second potential assignment for two trucks. Thissecond potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“3”, or a second potential route involving traversal from location “3”to location “1”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the precalculatedshortest estimated travel times for shortest paths between theselocations in the precomputed shortest path matrix. Thus, the routeinvolving traversal from location “1” to location “3” can be determinedbased on the precomputed shortest path matrix to have a total estimatedtravel time of 24 seconds, and the route involving traversal fromlocation “3” to location “1” can be determined based on the precomputedshortest path matrix to have a total estimated travel time of 28seconds.

This second potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“2” to location “4”, or a second potential route involving traversalfrom location “4” to location “2”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe precalculated shortest estimated travel times for shortest pathsbetween these locations in the precomputed shortest path matrix. Thus,the route involving traversal from location “2” to location “4” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 28 seconds, and the route involving traversalfrom location “4” to location “2” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 28 seconds.

A total estimated travel time for this second potential assignment canbe determined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIG. 78. Here, a total estimatedtravel time for this first potential assignment can be calculated to be52 seconds, as illustrated in FIG. 78.

FIG. 79 illustrates a third potential assignment for two trucks. Thisthird potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“4”, or a second potential route involving traversal from location “4”to location “1”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the precalculatedshortest estimated travel times for shortest paths between theselocations in the precomputed shortest path matrix. Thus, the routeinvolving traversal from location “1” to location “4” can be determinedbased on the precomputed shortest path matrix to have a total estimatedtravel time of 48 seconds, and the route involving traversal fromlocation “4” to location “1” can be determined based on the precomputedshortest path matrix to have a total estimated travel time of 52seconds.

This third potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“2” to location “3”, or a second potential route involving traversalfrom location “3” to location “2”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe precalculated shortest estimated travel times for shortest pathsbetween these locations in the precomputed shortest path matrix. Thus,the route involving traversal from location “2” to location “3” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 23 seconds, and the route involving traversalfrom location “3” to location “2” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 45 seconds.

A total estimated travel time for this third potential assignment can bedetermined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIG. 79. Here, a total estimatedtravel time for this first potential assignment can be calculated to be71 seconds, as illustrated in FIG. 79.

The calculated total estimated travel times for each potentialassignment can be compared to determine an optimized or preferredassignment, as illustrated in FIG. 80. The optimized routes that wereutilized to determined the calculated total estimated travel times foreach potential assignment may be used as optimized routes for a routingsolution, or additional determination of optimized routes may beperformed.

As noted above, it will be appreciated that routing problems can takevarious forms. As another example, one or more vehicles may have a setstarting location which is to be taken into account in determining asolution.

Returning again to the locations illustrated in FIG. 50, consider such arouting problem in which two trucks having a set starting location oflocation “1” are to visit location “2”, location “3”, and location “4”(assuming that each truck is to visit at least one location). FIG. 81illustrates potential assignments of the trucks for solution of therouting problem. An exemplary approach to determining preferred oroptimized assignments for a high quality routing solution will now beoutlined utilizing the calculated travel times in the precomputedshortest path matrix of FIG. 67.

FIG. 82 illustrates a first potential assignment for two trucks. Thisfirst potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“2” and traversal from location “2” to location “3”, or a secondpotential route involving traversal from location “1” to location “3”and traversal from location “3” to location “2”. A total estimatedtravel time for each potential route for the first truck can bedetermined utilizing the precalculated shortest estimated travel timesfor shortest paths between these locations in the precomputed shortestpath matrix. Thus, the route involving traversal from location “1” tolocation “2” and traversal from location “2” to location “3” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 53 seconds, and the route involving traversalfrom location “1” to location “3” and traversal from location “3” tolocation “2” can be determined based on the precomputed shortest pathmatrix to have a total estimated travel time of 69 seconds.

This first potential assignment further involves, for a second truck,use of a potential route involving traversal from location “1” tolocation “4”. A total estimated travel time for this potential route forthe second truck can be determined utilizing the precalculated shortestestimated travel times for shortest paths between these locations in theprecomputed shortest path matrix. Thus, the route involving traversalfrom location “1” to location “4” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 48 seconds.

A total estimated travel time for this first potential assignment can bedetermined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIG. 82. Here, a total estimatedtravel time for this first potential assignment can be calculated to be101 seconds, as illustrated in FIG. 82.

FIG. 82 illustrates a second potential assignment for two trucks. Thissecond potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“2” and traversal from location “2” to location “4”, or a secondpotential route involving traversal from location “1” to location “4”and traversal from location “4” to location “2”. A total estimatedtravel time for each potential route for the first truck can bedetermined utilizing the precalculated shortest estimated travel timesfor shortest paths between these locations in the precomputed shortestpath matrix. Thus, the route involving traversal from location “1” tolocation “2” and traversal from location “2” to location “4” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 58 seconds, and the route involving traversalfrom location “1” to location “4” and traversal from location “4” tolocation “2” can be determined based on the precomputed shortest pathmatrix to have a total estimated travel time of 76 seconds.

This second potential assignment further involves, for a second truck,use of a potential route involving traversal from location “1” tolocation “3”. A total estimated travel time for this potential route forthe second truck can be determined utilizing the precalculated shortestestimated travel times for shortest paths between these locations in theprecomputed shortest path matrix. Thus, the route involving traversalfrom location “1” to location “3” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 24 seconds.

A total estimated travel time for this second potential assignment canbe determined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIG. 83. Here, a total estimatedtravel time for this first potential assignment can be calculated to be82 seconds, as illustrated in FIG. 83.

FIG. 83 illustrates a third potential assignment for two trucks. Thisthird potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“3” and traversal from location “3” to location “4”, or a secondpotential route involving traversal from location “1” to location “4”and traversal from location “4” to location “3”. A total estimatedtravel time for each potential route for the first truck can bedetermined utilizing the precalculated shortest estimated travel timesfor shortest paths between these locations in the precomputed shortestpath matrix. Thus, the route involving traversal from location “1” tolocation “3” and traversal from location “3” to location “4” can bedetermined based on the precomputed shortest path matrix to have a totalestimated travel time of 48 seconds, and the route involving traversalfrom location “1” to location “4” and traversal from location “4” tolocation “3” can be determined based on the precomputed shortest pathmatrix to have a total estimated travel time of 72 seconds.

This third potential assignment further involves, for a second truck,use of a potential route involving traversal from location “1” tolocation “2”. A total estimated travel time for this potential route forthe second truck can be determined utilizing the precalculated shortestestimated travel times for shortest paths between these locations in theprecomputed shortest path matrix. Thus, the route involving traversalfrom location “1” to location “2” can be determined based on theprecomputed shortest path matrix to have a total estimated travel timeof 30 seconds.

A total estimated travel time for this second potential assignment canbe determined by summing together the lowest calculated estimated traveltime for each truck, as illustrated in FIG. 84. Here, a total estimatedtravel time for this first potential assignment can be calculated to be78 seconds, as illustrated in FIG. 84.

The calculated total estimated travel times for each potentialassignment can be compared to determine an optimized or preferredassignment, as illustrated in FIG. 85. The optimized routes that wereutilized to determine the calculated total estimated travel times foreach potential assignment may be used as optimized routes for a routingsolution, or additional determination of optimized routes may beperformed.

Notably, calculated values, such as a calculated estimated time value,may be weighted, e.g. for calculations for determining a shortest,optimal, or preferred path, assignment, or route. For example, FIG. 86illustrates weighting of an estimated time value for an assignment, andFIG. 87 illustrates calculation of such weighted estimated time valuesfor potential assignments.

Further, calculated values, such as a calculated estimated time value,may be normalized, e.g. for calculations for determining a shortest,optimal, or preferred path, or preferred or optimized assignment orroute. For example, FIG. 88 illustrates calculation of a normalizedvalue for an estimated time value for an assignment, and FIG. 89illustrates calculation of such normalized estimated time values forpotential assignments.

Utilizing Constraints and Penalties to Facilitate Determination of HighQuality Solutions to Multi-Objective Routing Problems

A classic approach to generating a solution to a routing probleminvolves trying to minimize travel time while adhering to hard timewindow constraints. In reality, however, many problems aremulti-objective, and it may be desirable to account for a variety oftradeoffs such as, for example, travel time, importance of assigningcertain drivers or vehicles to individual customers, visiting as manycustomers as possible, avoiding certain roads at some times of day, etc.For example, objectives for a routing problem may include minimizingtotal travel time, minimizing fuel costs, minimizing a number ofvehicles used, making sure the right vehicle or driver visits eachcustomer, minimizing overtime costs, and visiting as many high prioritycustomers as possible. Systems and methodologies in accordance with oneor more preferred implementations are configured to facilitate solutionof multi-objective routing optimization problems where there aretradeoffs between possibly conflicting objectives.

In accordance with one or more preferred implementations, a methodologyinvolves defining one or more constraints related to features ofpossible solutions to a routing problem. Each constraint is assigned apenalty value or weight based on how important it is, e.g. a higherpenalty can indicate increased importance of adhering to the constraint.An approach in accordance with one or more preferred implementationsinvolves applying mathematical optimization to try and generatesolutions that have as low a total score as possible where the score isgenerated utilizing a sum of determined penalty values.

In accordance with one or more preferred implementations, a constraintis a rule that asks a yes or no question about the solution to aproblem. Exemplary constraints might be, for example: “Is the driverworking more than 8 hours?”, “Is the vehicle traveling more than 200miles in a day?”, “Is customer x being serviced by driver y?”, “Iscustomer x being serviced on Wednesday between 9 am and 11 am?”, “Doesthe driver get a lunch break?”, or “Are we visiting at least 5 highpriority customers today?”.

In accordance with one or more preferred implementations, a penalty is anumerical quantity assigned to each instance in a solution when aconstraint is violated. A penalty might be, for example, that if adriver is driving more than eight hours on a day, that solution ispenalized x points (for each violation instance within that solution). Apenalty may also be configured to be applied based on the extent ofviolation of a constraint. For example, a solution may be penalized anadditional y points for every ten minutes over the eight hour limit.

In accordance with one or more preferred implementations, the overallquality of the solution can be characterized utilizing a sum of all ofthese penalties which measures which rules are broken and how importanteach of those violations is to the user's overall preferences. Inaccordance with one or more preferred implementations, by viewingrouting problems as multi-objective, a system is able to determinepotential solutions that match what a user really wants. Additionally, asystem can provide multiple solutions back to a user to allow the userto select which solution he or she feels best addresses his or herneeds.

As a more specific example, consider a routing problem in which it isdesired to avoid curvy roads. In particular, returning again to thelocations illustrated in FIG. 50 and the routing problem illustrated inFIG. 81 in which two trucks having a set starting location of location“1” are to visit location “2”, location “3”, and location “4” (assumingthat each truck is to visit at least one location), now consider thesame routing problem where it is additionally desired to avoid curvyroads.

Notably, a curviness value for a road segment can be stored ordetermined based on data for that road segment. For example, a curvinessvalue for a road segment could be determined by dividing a traversallength of a road segment by a Euclidean distance between two endpointsof that road segment, as fancifully illustrated in FIG. 90. In FIG. 90,a curviness value for the road segment AC is determined to be “1.1”. Inaccordance with one or more preferred implementations, a curviness valuemay be determined based on a distance calculated using the Haversineformula.

FIG. 91 illustrates an exemplary user interface which allows a user tospecify constraints and penalties for use in generating solutions to arouting problem, e.g. the routing problem illustrated in FIG. 81 inwhich two trucks having a set starting location of location “1” are tovisit location “2”, location “3”, and location “4” (assuming that eachtruck is to visit at least one location).

FIG. 92 illustrates the same exemplary user interface where a user hasindicated that with respect to violation of a constraint that a routedoes not include a road with a curviness value at or over “1.05”, apenalty of “3” points is to be applied for every “0.05” over “1.00”.

A penalty could be specified in various formats, and could be weightedin various ways. For example, a penalty could be specified as points (asillustrated), or as seconds which are to be applied to a total estimatedtime for a route or solution.

In this example, points are weighted to generate a penalty value bydividing the total number of points by 100, as illustrated in FIG. 93A,although it will be appreciated that weighting may not always be used,or that other various weights may be utilized.

A penalty value can be added to a value for a path, route, assignment,or solution to produce an adjusted value. A penalty value might be addedto a weighted estimated value, as illustrated in FIG. 93B, or anormalized estimated value, as illustrated in FIG. 93C.

In this example, a penalty is added to a route for each instance oftraversal over a road segment which has a curviness value at or over1.05. For each instance, the penalty is equal to three points for each“0.05” over “1.00”.

FIG. 94 illustrates how, for the route including traversal from location“1” to location “3” and from location “3” to location “4”, a penalty ofsix points is incurred owing to traversal of road segment AC duringtraversal from location “3” to location “4”. This penalty is incurredbecause, as illustrated in FIG. 90, the road segment AC has a curvinessvalue of “1.1”. A penalty value for this route is calculated by dividingthe total number of penalty points by “100”, resulting in a penaltyvalue for this route of “0.06”, as illustrated in FIG. 94.

Similarly, FIG. 94 illustrates how, for the route including traversalfrom location “1” to location “4” and from location “4” to location “3”,a penalty of six points is incurred owing to traversal of road segmentCA during traversal from location “4” to location “3”. This penalty isincurred because the road segment CA has a curviness value of “1.1”. Apenalty value for this route is calculated by dividing the total numberof penalty points by “100”, resulting in a penalty value for this routeof “0.06”, as illustrated in FIG. 94.

An adjusted value can be calculated for a potential solution by addingtogether penalty values calculated for the various routes forming partof that solution to a weighted or normalized value for that solution(e.g. the sum of weighted or normalized values for the routes formingpart of that solution).

FIG. 95 illustrates adjusted values calculated for potential solutionsby adding calculated penalty values for routes for the solutions tonormalized estimated values for the solutions. As illustrated, althoughsolution number five has the lowest total estimated travel time ofseventy eight seconds, once penalty values are applied based onspecified constraints and penalties, solution number three has thelowest adjusted value taking into account these specified constraintsand penalties, with an adjusted value of “1.051”.

In accordance with one or more preferred implementations, an exemplarymethodology for generating high quality solutions to a routing probleminvolves sending problem data and constraint (and penalty) data to asystem (e.g. an optimization service running at one or more servers).This problem data can include, for example, latitude and longitudecoordinates for locations for the routing problem, customer attributes,vehicle attributes, driver attributes, etc. This problem data andconstraint data may be sent together, as illustrated in FIG. 96A, orseparately as illustrated in FIG. 96B.

In accordance with one or more preferred implementations, followingreceipt of problem and constraint data, the system generates a largenumber of possible solutions (e.g. millions) and evaluates how well eachsolution meets the specified constraints, as illustrated in FIG. 96C. Inaccordance with one or more preferred implementations, a penalty valueis calculated for all generated solutions, or for one or more of themore promising generated solutions. In accordance with one or morepreferred implementations, estimated time values or other generatedvalues are evaluated in combination with generated penalty values.

In accordance with one or more preferred implementations, the systemthereafter returns one or more solutions based on calculated values, asillustrated in FIG. 96D. In accordance with one or more preferredimplementations, a system returns multiple solutions with an indicationof an overall score (e.g. an adjusted value) and information on violatedconstraints.

In accordance with one or more preferred implementations, one or moredetermined available solutions (e.g. most preferred solutions) arepresented to a user, as illustrated in FIG. 97, and the user is allowedto select from the presented available solutions.

In accordance with one or more preferred implementations, an indicationof a total travel time, travel distance, or cost (e.g. fuel costs, laborcosts, or both) is presented to a user for each presented availablesolution.

In accordance with one or more preferred implementations, one or morepenalty values may be added to a value generated based on an estimatedtravel time, distance, or cost (such as a fuel cost or a labor cost orboth) to facilitate identification or ranking of potential solutions, ormay be solely utilized to facilitate identification or ranking ofpotential solutions.

In accordance with various preferred implementations, variousmethodologies for applying a penalty value to road segments, paths,routes, assignments, or solutions may be utilized.

For example, FIG. 98 illustrates calculation of an adjusted value forvarious potential paths during determination of an optimized route fortravel from location “1” to location “4”, where calculation of theadjusted value involves summing a weighted estimated value based on atotal estimated travel time for a path with a penalty value. This allowsfor determination of an adjusted value for an optimal path betweenlocation “1” and location “4” given the specified constraints andpenalties.

In accordance with one or more preferred implementations, an optimalpath matrix is populated with calculated adjusted values for travelbetween locations under specified constraints and penalties, asillustrated in FIG. 99. Such an optimal path matrix can be utilized todetermine optimized routes, and optimized or high quality assignmentsand solutions.

For example, FIG. 99 illustrates calculated adjusted values for routesfor a first potential assignment together with a calculated totaladjusted value for optimized routes under the first potentialassignment, FIG. 100 illustrates calculated adjusted values for routesfor a second potential assignment together with a calculated totaladjusted value for optimized routes under the second potentialassignment, and FIG. 101 illustrates calculated adjusted values forroutes for a third potential assignment together with a calculated totaladjusted value for optimized routes under the third potentialassignment. These calculated adjusted values can be utilized to identifya preferred or optimized assignment, as illustrated in FIG. 102A, orpreferred or optimized solution (representing a high quality solution),as illustrated in FIG. 102B.

Penalty values may be utilized to calculated adjusted values for roadsegments or path portions during evaluation of paths, e.g. duringdetermination of a shortest or optimal path between two locations, asillustrated in FIG. 103 where adjusted values have been calculated forpath portions to facilitate determination of a shortest path fromlocation “1” to location “4”.

Utilizing Estimated Traversal Values to Accelerate the Determination ofHigh Quality Solutions to Routing Problems

As described herein, methodologies for determining high qualitysolutions to routing problems may involve computing a shortest oroptimal path matrix containing shortest or optimal path information fortravel between locations involved in the routing problem. As the numberof locations involved in a routing problem grows, this begins to greatlyincrease the number of computations that are required to compute such ashortest or optimal path matrix. In general, for a routing probleminvolving n locations, approximately n*n shortest or optimal paths mustbe determined. Thus, for example, for a routing problem involving onethousand locations, one million shortest or optimal paths would have tobe determined to compute the shortest or optimal path matrix.

Computing such a matrix can be a cumbersome and time consuming processand can delay the solution to a routing problem, e.g. a routingoptimization problem that involves a road network.

However, a very fast approximation to road network travel time can beobtained by using estimated distances and travel times (e.g. “crowflies” approximations such as a Euclidean distance or a distancecomputed using the Haversine formula). In a simplified example, adistance is computed using the Haversine formula, and then a reasonableestimate of a speed of a vehicle is utilized to calculate a travel timeestimate.

In accordance with one or more preferred implementations, a more complexestimate utilizes an estimate of the curvature (e.g. curviness value) ofroads in an area in order to weight a distance approximation (or a speedor time estimate). For example, a highway or interstate would generallyhave very little curvature (e.g. a low curviness value) since it isgenerally straight allowing for a high rate of travel.

Such an approach might, for example, involve taking into account acurvature (e.g. curviness value) of roads around a start location,taking into account a curvature (e.g. curviness value) of roads around adestination location, and taking into account a curvature (e.g.curviness value) of roads between such locations. A curvature (e.g.curviness value) for an area may be determined based on curvature (e.g.curviness values) for roads in the area (e.g. aggregating or averagingcurviness values for roads in the area).

In accordance with one or more preferred implementations, a methodologyinvolves accelerating the solution to an optimization problem thatinvolves a road network. While accurate solutions to these problemsgenerally require distances and travel times to be computed whileaccounting for streets, turns, and predicted traffic, in accordance withone or more preferred implementations, a methodology involves firstcomputing estimates or approximations of distances and travel times, andthen beginning optimization for the problem using these approximationswhile simultaneously, in parallel, performing distance and travel timecomputations for the road network (e.g. computing a shortest or optimalpath matrix), gaining an overall speedup in the solution of theoptimization problem.

As a simplistic example, returning again to the locations illustrated inFIG. 50, FIG. 104 illustrates a calculated Euclidean distance estimatefor travel from location “1” to location “2”. This calculated Euclideandistance estimate value for travel from location “1” to location “2” canbe stored in a shortest path or optimal path matrix, as illustrated inFIG. 105. This may be a shortest or optimal path matrix that iseventually updated with computed shortest path distance values, or maybe a different matrix.

FIG. 106 similarly illustrates a calculated Euclidean distance estimatevalue for travel from location “1” to location “3”. This calculatedEuclidean distance estimate value for travel from location “1” tolocation “3” can also be stored in the matrix, as illustrated in FIG.107.

A calculated Euclidean distance estimate value can similarly becalculated and stored for traveling from each location to each otherlocation, as illustrated in FIG. 108.

Further, estimated time values can be calculated based on thesecalculated Euclidean distance estimate values, and stored in a shortestor optimal path matrix, as illustrated in FIG. 109. This may be ashortest or optimal path matrix that is eventually updated with computedshortest path distance values, or may be a different matrix.

In accordance with one or more preferred implementations, suchcalculated estimated distance values and corresponding calculatedestimated time values can be utilized to begin determination of one ormore high quality solutions to a routing problem.

For example, FIG. 110 illustrates a first potential route visiting allfour locations which involves traversal from location “1” to location“2”, traversal from location “2” to location “3”, and traversal fromlocation “3” to location “4”. A total estimated travel time for thisroute can be determined utilizing the estimated travel times forshortest paths between these locations in the shortest path matrix whichwere generated based on the Euclidean distance estimate values. Thus,the route portion representing traversal from location “1” to location“2” can be determined based on the shortest path matrix to have anestimated travel time of 14 seconds, the route portion representingtraversal from location “2” to location “3” can be determined based onthe precomputed shortest path matrix to have an estimated travel time of14 seconds, and the route portion representing traversal from location“3” to location “4” can be determined based on the precomputed shortestpath matrix to have an estimated travel time of 26 seconds. A totalestimated travel time for the route can be calculated by summingtogether these estimated travel times for these route portions. Thisresults in a total estimated travel time for the first potential routeof 54 seconds, as illustrated in FIG. 110.

FIG. 111 illustrates a second potential route visiting all fourlocations which involves traversal from location “1” to location “3”,traversal from location “3” to location “4”, and traversal from location“4” to location “2”. A total estimated travel time for this route can bedetermined utilizing the estimated travel times for shortest pathsbetween these locations in the shortest path matrix which were generatedbased on the Euclidean distance estimate values. The route portionrepresenting traversal from location “1” to location “3” can bedetermined based on the shortest path matrix to have an estimated traveltime of 20 seconds, the route portion representing traversal fromlocation “3” to location “4” can be determined based on the shortestpath matrix to have an estimated travel time of 26 seconds, and theroute portion representing traversal from location “4” to location “2”can be determined based on the shortest path matrix to have an estimatedtravel time of 32 seconds. These calculated estimated travel times forthe route portions can be summed together to result in a total estimatedtravel time for the second potential route of 78 seconds, as illustratedin FIG. 111.

A preferred or optimized route can be identified based on the calculatedtotal estimated travel times for each potential route, as illustrated inFIG. 112.

In accordance with one or more preferred implementations, a methodologyinvolves, while beginning optimization for the routing problem usingthese approximations, simultaneously, in parallel, performing distanceand travel time computations for the road network (e.g. updating theshortest or optimal path matrix with computed values), gaining anoverall speedup in the solution of the optimization problem.

For example, FIG. 113 illustrates updating of the shortest path matrixof FIG. 109 with computed values for traversal from location “1” tolocation “2”.

As determination of high quality solutions to a routing problemproceeds, these updated values may be utilized as they are computed,resulting in increasingly accurate optimization results.

In accordance with one or more preferred implementations, one or moredeterminations or calculations performed as part of a methodology fordetermining one or more high quality solutions to a routing problem areperformed utilizing estimates or approximate values, while one or moresubsequent determinations of calculations performed as part of the samemethodology are performed utilizing updated, more accurate computedvalues.

For example, returning again to the locations illustrated in FIG. 50 andthe routing problem illustrated in FIG. 75 in which two trucks are tovisit the four locations (assuming that each truck is to visit two ofthe locations), in accordance with one or more preferredimplementations, optimized assignments for the trucks might bedetermined using values based on Euclidean or Haversine estimates, whilemore accurate high quality solutions may subsequently be determinedutilizing more accurate, computed values.

FIG. 114 illustrates a first potential assignment for two trucks. Thisfirst potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“2”, or a second potential route involving traversal from location “2”to location “1”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the estimated traveltimes for shortest paths between these locations in the shortest pathmatrix which were generated based on the Euclidean distance estimatevalues. It will be appreciated that, in this example, because the valuesare based on Euclidean distance estimates, the value for travel in afirst direction is the same as a value for travel in a second, oppositedirection. Here, the routes involving traversal between location “1” andlocation “2” can be determined based on the estimated travel times forshortest paths between these locations in the shortest path matrix tohave a total estimated travel time of 14 seconds.

This first potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“3” to location “4”, or a second potential route involving traversalfrom location “4” to location “3”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe estimated travel times for shortest paths between these locations inthe shortest path matrix which were generated based on the Euclideandistance estimate values. It will be appreciated that, in this example,because the values are based on Euclidean distance estimates, the valuefor travel in a first direction is the same as a value for travel in asecond, opposite direction. Here, the routes involving traversal betweenlocation “3” and location “4” can be determined based on the estimatedtravel times for shortest paths between these locations in the shortestpath matrix to have a total estimated travel time of 26 seconds.

A total estimated travel time for this first potential assignment can bedetermined by summing together the estimated travel times for eachtruck, as illustrated in FIG. 114. Here, a total estimated travel timefor this first potential assignment can be calculated to be 40 seconds,as illustrated in FIG. 114.

FIG. 115 illustrates a second potential assignment for two trucks. Thissecond potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“3”, or a second potential route involving traversal from location “2”to location “4”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the estimated traveltimes for shortest paths between these locations in the shortest pathmatrix which were generated based on the Euclidean distance estimatevalues. It will be appreciated that, in this example, because the valuesare based on Euclidean distance estimates, the value for travel in afirst direction is the same as a value for travel in a second, oppositedirection. Here, the routes involving traversal between location “1” andlocation “3” can be determined based on the estimated travel times forshortest paths between these locations in the shortest path matrix tohave a total estimated travel time of 20 seconds.

This second potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“2” to location “4”, or a second potential route involving traversalfrom location “4” to location “2”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe estimated travel times for shortest paths between these locations inthe shortest path matrix which were generated based on the Euclideandistance estimate values. It will be appreciated that, in this example,because the values are based on Euclidean distance estimates, the valuefor travel in a first direction is the same as a value for travel in asecond, opposite direction. Here, the routes involving traversal betweenlocation “2” and location “4” can be determined based on the estimatedtravel times for shortest paths between these locations in the shortestpath matrix to have a total estimated travel time of 32 seconds.

A total estimated travel time for this second potential assignment canbe determined by summing together the estimated travel times for eachtruck, as illustrated in FIG. 115. Here, a total estimated travel timefor this first potential assignment can be calculated to be 52 seconds,as illustrated in FIG. 115.

FIG. 116 illustrates a third potential assignment for two trucks. Thisthird potential assignment involves, for a first truck, use of either afirst potential route involving traversal from location “1” to location“4”, or a second potential route involving traversal from location “2”to location “3”. A total estimated travel time for each potential routefor the first truck can be determined utilizing the estimated traveltimes for shortest paths between these locations in the shortest pathmatrix which were generated based on the Euclidean distance estimatevalues. It will be appreciated that, in this example, because the valuesare based on Euclidean distance estimates, the value for travel in afirst direction is the same as a value for travel in a second, oppositedirection. Here, the routes involving traversal between location “1” andlocation “4” can be determined based on the estimated travel times forshortest paths between these locations in the shortest path matrix tohave a total estimated travel time of 44 seconds.

This third potential assignment further involves, for a second truck,use of either a first potential route involving traversal from location“2” to location “3”, or a second potential route involving traversalfrom location “3” to location “2”. A total estimated travel time foreach potential route for the second truck can be determined utilizingthe estimated travel times for shortest paths between these locations inthe shortest path matrix which were generated based on the Euclideandistance estimate values. It will be appreciated that, in this example,because the values are based on Euclidean distance estimates, the valuefor travel in a first direction is the same as a value for travel in asecond, opposite direction. Here, the routes involving traversal betweenlocation “2” and location “3” can be determined based on the estimatedtravel times for shortest paths between these locations in the shortestpath matrix to have a total estimated travel time of 14 seconds.

A total estimated travel time for this third potential assignment can bedetermined by summing together the estimated travel times for eachtruck, as illustrated in FIG. 116. Here, a total estimated travel timefor this first potential assignment can be calculated to be 58 seconds,as illustrated in FIG. 116.

The calculated total estimated travel times for each potentialassignment can be compared to determine an optimized or preferredassignment, as illustrated in FIG. 117. The optimized routes that wereutilized to determined the calculated total estimated travel times foreach potential assignment may be used as optimized routes for a routingsolution, or additional determination of optimized routes may beperformed.

For example, although these optimized assignments for the trucks weredetermined using values based on Euclidean distance estimates, a moreaccurate high quality solution may subsequently be determined utilizingmore accurate, computed values.

In this regard, FIG. 118 illustrates use of updated computed values inthe shortest path matrix to determine an optimized order or route fortraversal between location “1” and location “2”. Here, it is determinedthat traversal from location “2” to location “1” has a shorter estimatedtravel time than traversal from location “1” to location “2”, asillustrated in FIG. 118.

FIG. 119 further illustrates use of updated computed values in theshortest path matrix to determine an optimized order or route fortraversal between location “3” and location “4”. Here, it is determinedthat traversal from location “3” to location “4” has the same estimatedtravel time as traversal from location “4” to location “3”, asillustrated in FIG. 119.

Such calculations based on updated computed values in the shortest pathmatrix can be utilized in determining one or more high quality routingsolutions. For example, FIG. 120 illustrates calculation of an estimatedtravel time, based on computed values, for the assignment that waspreviously determined, based on estimated values, to be preferred oroptimized.

In accordance with one or more preferred implementations, a methodologymay involve selectively computing shortest path information based ondeterminations made utilizing estimates or approximations. For example,with respect to the just outlined example, a methodology may onlyrequire computing accurate shortest path values for paths determined tobe part of a preferred or optimized assignment, as illustrated in FIG.121.

More generally, a methodology may involve only computing accurateshortest path values for paths determined to be likely to be part of ahigh quality routing solution (e.g. a preferred or optimized routingsolution), or which cannot be ruled out as being part of a high qualityrouting solution.

As noted above, in accordance with one or more preferredimplementations, a more complex estimate can utilize an estimate of thecurvature (e.g. curviness value) of roads in an area in order to weighta distance approximation (or a speed or time estimate). For example,FIG. 122 fancifully illustrates exemplary calculation of a deformedEuclidean distance estimate for travel from location “1” to location “2”using an area curviness value of “1.2”.

Although simplified fanciful examples are provided herein utilizingEuclidean distance estimates, in one or more preferred implementations,estimates or approximations utilize distance values calculated utilizingthe Haversine formula, e.g. calculated Haversine values which are thendeformed based on one or more estimates of curvature of roads in one ormore areas.

Utilizing Determined Optimized Traffic Windows for Precomputing OptimalPath Matrices to Reduce Computer Resource Usage

As noted above, it will be appreciated that traffic patterns mayfrequently allow for quicker traversal of a road segment (or navigationfrom one road segment to another) at certain times of the day, andslower traversal at other times. As described above, to account forthis, exemplary average travel times may be determined for windowsthroughout the day, e.g. for 24 one hour windows, as illustrated inFIGS. 33-34, and determination of a shortest path may involve utilizingthe time estimates for a window within which a current time falls, orwithin which an estimated time of travel falls.

Similarly, as noted above, a matrix containing calculated values fordetermined shortest paths may be precomputed and stored for time windowsthroughout the day, e.g. for 24 one hour windows, as illustrated in FIG.69.

Notably, although a rate of travel for a road segment generally changesthroughout the day, it generally changes slowly and somewhatcontinuously as long as there are no surprise disruptions such as a caraccident (which cannot be predicted).

In accordance with one or more preferred implementations, it isdesirable to break up a day (or week, month, or year) into as few timeintervals (or windows) as possible where the overall traffic during eachwindow is similar and the speeds in different traffic windows is asdifferent as possible. In accordance with one or more preferredimplementations, a methodology involves assuming that the rate of travelon each road segment is constant during a window, or utilizing a simple,defined formula to determine an estimated travel time or speed during awindow.

The use of a reduced number of windows as compared to, for example,twenty four one hour windows or forty eight thirty minute windows allowsfor more rapid precomputation of one or more required shortest oroptimal path matrices for a routing problem, and thus quickerdetermination of a solution with less resource usage (e.g. lessprocessing time, less memory usage, and optionally less storage usage).

A methodology in accordance with one or more preferred implementationsinvolves applying statistical methods to determine the points in timethat best partition a twenty four hour day into traffic windows suchthat the rate of travel within each window is most constant.

For example, FIG. 123 illustrates plotting of a normalized averagetravel time to traverse a particular road segment throughout the day.Each normalized average travel time value for a particular time iscalculated by dividing a minimum average travel time value for the roadsegment (the lowest value at any time throughout the day) by an averagetravel time at that particular time.

It will be appreciated that a similar methodology can be performed withnormalized speed values. For example, FIG. 124 illustrates plotting of anormalized average speed for a particular road segment throughout theday. Each normalized average speed value for a particular time iscalculated by dividing an average speed at that particular time by amaximum average speed value for the road segment (the highest value atany time throughout the day).

Under either approach, various methodologies including statisticalmethodologies can be applied to determine the points in time that bestpartition a day into traffic windows.

For purposes of a simplified example, FIG. 125 illustrates plotting of anormalized average travel time to traverse road segment AC during eachof twenty four one hour windows throughout the day. FIG. 126 furtherincludes plotting of a normalized average travel time to traverse roadsegments CA and AD during each of the same twenty four one hour windowsthroughout the day.

In accordance with one or more preferred implementations, a best fitline can be calculated based on average travel time or speed valuesthroughout a day, e.g. normalized average travel time or speed values.

FIG. 127 illustrates exemplary C Sharp style pseudocode for verysimplified calculation of a best fit line based on normalized averagetravel time values throughout the day.

For example, returning to the simplified example of FIG. 125, FIG. 128fancifully illustrates calculation of a best fit average travel timevalue for a simplified best fit line for the window “0:00-0:59”. FIG.129 illustrates plotting of this best fit average travel time value fora simplified best fit line for the window “0:00-0:59”. FIG. 130illustrates similar plotting of similarly calculated best fit averagetravel time values for a simplified best fit line for other windows, andFIG. 131 illustrates how these values can be characterized as forming abest fit line.

In accordance with one or more preferred implementations, statisticalmethods are applied to best fit data or a best fit line or curve to findone or more inflection points in best fit data, a best fit line, or abest fit curve. These are points where a rate of change begins to change(e.g. a second derivative in calculus). In accordance with one or morepreferred implementations, determined inflection points are utilized ascutoff points separating traffic windows.

Returning to the simplified example of FIG. 125, FIG. 132 fancifullyillustrates simplified calculation of a second order delta representinga change in the rate of change at the time interval “1:00-1:59”. Thisinvolves first calculating a delta in the best fit line from timeinterval “0:00-0:59” to time interval “1:00-1:59”, which is calculatedto be “0.0”. This further involves calculating a delta in the best fitline from time interval “1:00-1:59” to time interval “2:00-2:59”, whichis calculated to be “0.083”. A second order delta for time interval“1:00-1:59” can then be calculated by determining a difference betweenthe two calculated values, which is calculated to be “0.083”.

It will be appreciated that this is a very simple methodology forcalculating a second order delta, and merely is based on the rate ofchange for the one hour interval prior to the current interval, and theone hour interval subsequent to the current interval, and that othermethodologies could equally be utilized. For example, methodologies maybe utilized which consider more than three hours of data in determininga second order delta, or which consider less than three hours of data indetermining a second order delta.

In accordance with one or more preferred implementations, a determinedvalue for a second order delta or derivative may be compared to aminimum threshold to determine whether a particular time or timeinterval should be used as a cutoff to define a traffic window.

Returning to the simplified example of FIG. 125, FIG. 133 fancifullyillustrates comparison of the calculated second order delta of FIG. 132to a threshold value, and determination that the calculated second orderdelta is greater than the threshold value, and thus that thecorresponding time interval should be used as a cutoff to define atraffic window.

FIG. 134 fancifully illustrates that it has been determined that thecorresponding time interval “1:00-1:59” should be used as a cutoff todefine a traffic window.

Similar calculations can be carried to identify other time intervalswhich should be used as a cutoff to define a traffic window. FIG. 135fancifully illustrates additional time intervals that it has beendetermined should be used as a cutoff to define a traffic window.

Preferably, these determined time intervals are utilized to define aplurality of traffic windows, as illustrated in FIG. 136.

FIG. 137 illustrates exemplary C Sharp style pseudocode for verysimplified determination of times to be utilized for definition oftraffic windows.

As described above, exemplary average travel times for each road segmentmay be determined for each of a plurality of determined and definedwindows, and determination of a shortest path may involve utilizing thetime estimates for a window within which a current time falls, or withinwhich an estimated time of travel falls. Further, a matrix containingcalculated values for determined shortest or preferred paths may beprecomputed and stored for each of these time windows, as illustrated inFIG. 138.

In accordance with one or more preferred implementations, trafficwindows are determined utilizing statistical or other methodologies, andfor each road segment an average travel time or speed is computed duringthat window, and used to represent an estimated travel time or speed forthat entire interval. In accordance with one or more preferredimplementations, a shortest or optimal path matrix containing calculatedvalues for determined shortest or optimal paths is precomputed andstored for each determined traffic window. In accordance with one ormore preferred implementations, traffic window determinations may bemade for a particular problem or area.

In accordance with one or more preferred implementations, determining anumber of traffic windows for which shortest or optimal path informationis precomputed allows for less computation as compared to requiringon-demand, in-process determination of a shortest or optimal path for aparticular time during comparison of paths or routes performed as partof a process for determining a solution to a routing problem. Inaccordance with one or more preferred implementations, determining anumber of traffic windows for which shortest or optimal path informationis precomputed allows for quicker determination of a solution.

In accordance with one or more preferred implementations, reducing anumber of traffic windows for which shortest or optimal path informationis precomputed allows for less computation as compared to computationover an increased number of intervals (e.g. twenty four one hourintervals). In accordance with one or more preferred implementations,reducing a number of traffic windows for which shortest or optimal pathinformation is precomputed allows for quicker determination of asolution with less resource usage (e.g. less processing time, lessmemory usage, and optionally less storage usage).

Utilizing a Geo-Locator Service and Zone Servers to Reduce ComputerResource Requirements for Determining High Quality Solutions to RoutingProblems

As described herein, methodologies for determining high qualitysolutions to routing problems may involve computing a shortest oroptimal path for travel between locations involved in the routingproblem. As noted above, as the number of locations involved in arouting problem grows, this begins to greatly increase the number ofcomputations that are required to compute such a shortest or optimalpath matrix. In general, for a routing problem involving n locations,approximately n*n shortest or optimal paths must be determined. Thus,for example, for a routing problem involving one thousand locations, onemillion shortest or optimal paths would have to be determined to computethe shortest or optimal path matrix.

Computing such a matrix can be a time consuming process and can delaythe solution to a routing problem, e.g. a routing optimization problemthat involves a road network.

Even more calculations and shortest path determinations may be requiredif data for various time intervals throughout a day is to be taken intoconsideration.

As more and more calculations and computations become required for morecomplex problems, it becomes increasingly important to be able toquickly compute information for shortest or optimal paths, e.g. ashortest or optimal path matrix. Rapid computation requires that therelevant data be stored in memory, but storing data on a large roadnetwork in memory (e.g. the road network for an entire state or country)requires a large amount of memory. This can quickly escalate intorequiring tens of gigabytes of memory (e.g. random access memory, or“RAM”), or even more.

While some routing problems may require use of road network data for anentire state or country, many routing problems may only require use ofroad network data for a much smaller area, such as a town, city, county,or portion of a state or country. It is inefficient to tie up a highvalue server having a large amount of memory to compute shortest oroptimal paths for a routing problem that is confined to a very smallgeographic area and only requires road network data for a very smallroad network.

For example, FIG. 139 illustrates an exemplary geographic areacomprising a road network. In a traditional implementation approach, arequester 510 would communicate a request related to a routing probleminvolving specified locations to a server 520, as illustrated in FIG.140.

This might, for example, be a request for one or more high qualitysolutions to a routing problem involving specified locations, or mightbe a request for a shortest or optimal path matrix for specifiedlocations.

The server 520 (or a related server) would include a large amount ofmemory to allow for loading of road segment data for a large roadnetwork, e.g. the entire road network within the geographical area.

In accordance with one or more preferred implementations, a geographicarea comprising a road network is divided up into a plurality of zones,and one or more servers are utilized for each zone to provide routingsolutions for that zone.

For example, with respect to the exemplary geographic area illustratedin FIG. 139, each state could be characterized as its own zone, asillustrated in FIG. 141, where North Carolina is highlighted with anincreased thickness line to fancifully illustrate its characterizationas a zone. Notably, zones can overlap one another, and can even belocated entirely within another zone. For example, the entire geographicarea illustrated in FIG. 139 might be a first zone, and the state ofNorth Carolina might be a second zone.

In accordance with one or more preferred methodologies, a server isprovided for each of these zones, as illustrated in FIG. 142, where aserver 620 includes data for a zone corresponding to the geographic areaillustrated in FIG. 139, and a server 630 includes data for a zonecorresponding to the state of North Carolina.

In this example, the state of Florida would itself be another zone, asillustrated in FIG. 143, where Florida is highlighted with an increasedthickness line to fancifully illustrate its characterization as a zone.FIG. 144 illustrates additional provision of a server 640 including datafor a zone corresponding to the state of Florida.

In accordance with one or more preferred implementations, a singleserver may include data for two or more zones, as illustrated in FIG.145, where server 730 includes data for a first zone corresponding tothe state of North Carolina and further includes data for a second zonecorresponding to the state of Florida.

In accordance with one or more preferred implementations, multiple zonesmay overlap with, or be nested inside of, other overlapping or nestingzones. For example, FIG. 146 illustrates a western portion of NorthCarolina that is highlighted with an increased thickness line tofancifully illustrate its characterization as a zone, FIG. 147illustrates a central portion of North Carolina that is highlighted withan increased thickness line to fancifully illustrate itscharacterization as a zone, and FIG. 148 illustrates an eastern portionof North Carolina that is highlighted with an increased thickness lineto fancifully illustrate its characterization as a zone. FIG. 149illustrates additional provision of servers 650,660,670 including datafor these zones. As noted above, a single server may include data fortwo or more zones, and data for these zones could be found on a singleserver, as illustrated in FIG. 150, where a server 740 includes data foreach of these zones.

As another example, FIG. 151 illustrates a geographic area comprisingthe states of Virginia, North Carolina, and South Carolina that ishighlighted with an increased thickness line to fancifully illustrateits characterization as a zone. FIG. 152 illustrates additionalprovision of a server 680 including data for this zone.

In accordance with one or more preferred implementations, a geo-locatorservice is utilized to allow a requestor to determine what server tocontact to receive information for a routing problem.

For example, FIG. 153 illustrates a server 690 comprising a geo-locatorservice 692 which contains information regarding the defined zones (e.g.sets of coordinates for defined boundaries of each of the zones). Thegeo-locator service 692 is configured to receive a list of sets ofcoordinates for locations involved in a routing problem, determine thesmallest zone that contains all of the locations, and return anindication of the determined zone or corresponding server.

As an example, consider a routing problem involving the three locationsfancifully illustrated in FIG. 154. In accordance with one or morepreferred methodologies, the server 690 hosting the locator service 692receives, from a requestor 610, a list comprising information for theselocations (e.g. in the form of latitude and longitude coordinates forthese locations), as illustrated in FIG. 155.

In accordance with one or more preferred methodologies, the locatorservice 692 accesses zone data for defined zones and determines asmallest defined zone containing all of these locations, as illustratedin FIG. 156. For example, in accordance with one or more preferredimplementations, each zone is defined by a plurality of sets of latitudeand longitude coordinates defining a boundary for that zone, and alocator service compares latitude and longitude coordinates forlocations involved in a routing problem to defined boundaries of definedzones to identify a smallest defined zone containing all of thelocations involved in the routing problem.

In accordance with one or more preferred implementations, a locatorservice 692 returns an identifier for an identified or determined zone,or an identifier or address for a server corresponding to thatidentified or determined zone. In accordance with one or more preferredmethodologies, the locator service 692 returns a name of an identifiedor determined zone and a uniform resource locator corresponding to thatidentified or determined zone, as illustrated in FIG. 157.

Such a returned uniform resource locator which corresponds to anidentified or determined zone preferably can be used to access one ormore servers corresponding to that identified or determined zone, asillustrated in FIG. 158, where a list comprising information forlocations (e.g. in the form of latitude and longitude coordinates forlocations) is communicated from the requestor 610 to a server 650corresponding to the zone previously determined by the requestor service692 to be the smallest defined zone containing all of the locationsinvolved in the routing problem. In accordance with one or morepreferred implementations, a computed shortest or optimal path matrix isreturned for the list of locations.

FIGS. 159-160 fancifully illustrate another example of determination ofa smallest defined zone containing all of the locations involved in arouting problem.

In accordance with one or more preferred implementations, communicationof a list comprising information for locations may be communicated aspart of a request for a shortest or optimal path matrix, or as part of arequest for one or more high quality solutions to a routing problem. Inaccordance with one or more preferred implementations, a response tosuch a request may include a shortest or optimal path matrix, or one ormore high quality solutions to a routing problem.

CONCLUSION

Based on the foregoing description, it will be readily understood bythose persons skilled in the art that the present invention has broadutility and application. Many embodiments and adaptations of the presentinvention other than those specifically described herein, as well asmany variations, modifications, and equivalent arrangements, will beapparent from or reasonably suggested by the present invention and theforegoing descriptions thereof, without departing from the substance orscope of the present invention. Accordingly, while the present inventionhas been described herein in detail in relation to one or more preferredembodiments, it is to be understood that this disclosure is onlyillustrative and exemplary of the present invention and is made merelyfor the purpose of providing a full and enabling disclosure of theinvention. The foregoing disclosure is not intended to be construed tolimit the present invention or otherwise exclude any such otherembodiments, adaptations, variations, modifications or equivalentarrangements, the present invention being limited only by the claimsappended hereto and the equivalents thereof.

1-20. (canceled)
 21. A method involving utilizing zone servers to reduceserver resource requirements for determining optimized solutions torouting problems, the method comprising: (a) maintaining electronic datacorresponding to a plurality of defined zones each corresponding to ageographic area, wherein (i) each defined zone has a defined boundary,(ii) a plurality of the defined zones each overlap with other of thedefined zones, and (iii) a plurality of the defined zones are eachlocated entirely within another defined zone; (b) maintaining aplurality of zone servers, each zone server including road network datafor one or more of the zones of the plurality of defined zones; (c)identifying a first zone server for a first routing problem by (i)electronically determining, based on information for a first pluralityof locations involved in the first routing problem, a first zonerepresenting a smallest defined zone that contains all of the locationsof the first plurality of locations, and (ii) electronically determininga first zone server corresponding to the determined first zone; and (d)obtaining, utilizing the first zone server, one or more optimizedsolutions to the first routing problem by (i) electronicallycommunicating, from a requesting device to the determined first zoneserver, first problem data for the first routing problem comprising datafor the plurality of locations involved in the first routing problem,(ii) electronically determining, at the first zone server correspondingto the determined zone in response to the communication of first problemdata, a first set of one or more optimized solutions to the firstrouting problem using a plurality of calculated travel time estimatesaccessed from one or more computed shortest path matrices, and (iii)returning, from the first zone server corresponding to the determinedfirst zone to the requesting device, data corresponding to thedetermined first set of one or more optimized solutions to the routingproblem; (e) identifying a second zone server for a second routingproblem by (i) electronically determining, based on information for asecond plurality of locations involved in the second routing problem, asecond zone representing a smallest defined zone that contains all ofthe locations of the second plurality of locations, and (ii)electronically determining a second zone server corresponding to thedetermined second zone; and (f) obtaining, utilizing the second zoneserver, one or more optimized solutions to the second routing problem by(i) electronically communicating, from the requesting device to thedetermined second zone server, second problem data for the secondrouting problem comprising data for the plurality of locations involvedin the second routing problem, (ii) electronically determining, at thesecond zone server corresponding to the determined zone in response tothe communication of second problem data, a second set of one or moreoptimized solutions to the second routing problem using a plurality ofcalculated travel time estimates accessed from one or more computedshortest path matrices, and (iii) returning, from the second zone servercorresponding to the determined second zone to the requesting device,data corresponding to the determined second set of one or more optimizedsolutions to the routing problem; (g) wherein the first zone server andsecond zone server are different zone servers.
 22. The method of claim21, wherein maintaining data corresponding to a plurality of definedzones each corresponding to a geographic area comprises maintaining, foreach defined zone, a list of latitude and longitude coordinates definingthe defined boundary for that zone.
 23. The method of claim 21, whereinmaintaining data corresponding to a plurality of defined zones eachcorresponding to a geographic area comprises maintaining, for eachdefined zone, a list of latitude and longitude coordinates defining thedefined boundary for that zone.
 24. The method of claim 21, whereindetermining, based on information for a plurality of locations involvedin a routing problem, a smallest defined zone that contains all of thelocations of the plurality of locations comprises comparing coordinatesfor each of the plurality of locations to defined boundaries for one ormore of the plurality of zones.
 25. The method of claim 21, whereindetermining, based on information for a plurality of locations involvedin a routing problem, a smallest defined zone that contains all of thelocations of the plurality of locations comprises comparing latitude andlongitude coordinates for each of the plurality of locations to definedboundaries for one or more of the plurality of zones.
 26. The method ofclaim 21, wherein the requesting device comprises a computing devicehaving a web browser loaded thereon.
 27. The method of claim 21, whereinthe requesting device comprises a desktop computer.
 28. The method ofclaim 21, wherein the requesting device comprises a laptop computer. 29.The method of claim 21, wherein the requesting device comprises atablet.
 30. The method of claim 21, wherein the requesting devicecomprises a phone.
 31. A method involving utilizing zone servers toreduce server resource requirements for facilitating determination ofoptimized solutions to routing problems, the method comprising: (a)maintaining electronic data corresponding to a plurality of definedzones each corresponding to a geographic area, wherein (i) each definedzone has a defined boundary, (ii) a plurality of the defined zones eachoverlap with other of the defined zones, and (iii) a plurality of thedefined zones are each located entirely within another defined zone; (b)maintaining a plurality of zone servers, each zone server including roadnetwork data for one or more of the zones of the plurality of definedzones; (c) identifying a first zone server for a first routing problemby (i) electronically determining, based on information for a firstplurality of locations involved in the first routing problem, a firstzone representing a smallest defined zone that contains all of thelocations of the first plurality of locations, and (ii) electronicallydetermining a first zone server corresponding to the determined firstzone; and (d) obtaining, utilizing the first zone server, one or moreshortest path matrices for use in determining optimized solutions to thefirst routing problem by (i) electronically communicating, from arequesting device to the determined first zone server, first problemdata for the first routing problem comprising data for the plurality oflocations involved in the first routing problem, (ii) electronicallycomputing, at the first zone server corresponding to the determined zonein response to the communication of first problem data, a first set ofone or more shortest path matrices comprising shortest path data fordirectional shortest paths between pairs of locations of the firstplurality of locations, and (iii) returning, from the first zone servercorresponding to the determined first zone to the requesting device,data corresponding to the computed first set of one or more shortestpath matrices comprising shortest path data for directional shortestpaths between pairs of locations of the first plurality of locations;(e) identifying a second zone server for a second routing problem by (i)electronically determining, based on information for a second pluralityof locations involved in the second routing problem, a second zonerepresenting a smallest defined zone that contains all of the locationsof the second plurality of locations, and (ii) electronicallydetermining a second zone server corresponding to the determined secondzone; and (f) obtaining, utilizing the second zone server, one or moreoptimized solutions to the second routing problem by (i) electronicallycommunicating, from the requesting device to the determined second zoneserver, second problem data for the second routing problem comprisingdata for the plurality of locations involved in the second routingproblem, (ii) electronically computing, at the second zone servercorresponding to the determined zone in response to the communication ofsecond problem data, a second set of one or more shortest path matricescomprising shortest path data for directional shortest paths betweenpairs of locations of the second plurality of locations, and (iii)returning, from the second zone server corresponding to the determinedsecond zone to the requesting device, data corresponding to the computedsecond set of one or more shortest path matrices comprising shortestpath data for directional shortest paths between pairs of locations ofthe second plurality of locations; (g) wherein the first zone server andsecond zone server are different zone servers.
 32. The method of claim31, wherein maintaining data corresponding to a plurality of definedzones each corresponding to a geographic area comprises maintaining, foreach defined zone, a list of latitude and longitude coordinates definingthe defined boundary for that zone.
 33. The method of claim 31, whereinmaintaining data corresponding to a plurality of defined zones eachcorresponding to a geographic area comprises maintaining, for eachdefined zone, a list of latitude and longitude coordinates defining thedefined boundary for that zone.
 34. The method of claim 31, whereindetermining, based on information for a plurality of locations involvedin a routing problem, a smallest defined zone that contains all of thelocations of the plurality of locations comprises comparing coordinatesfor each of the plurality of locations to defined boundaries for one ormore of the plurality of zones.
 35. The method of claim 31, whereindetermining, based on information for a plurality of locations involvedin a routing problem, a smallest defined zone that contains all of thelocations of the plurality of locations comprises comparing latitude andlongitude coordinates for each of the plurality of locations to definedboundaries for one or more of the plurality of zones.
 36. The method ofclaim 31, wherein the requesting device comprises a computing devicehaving a web browser loaded thereon.
 37. The method of claim 31, whereinthe requesting device comprises a desktop computer.
 38. The method ofclaim 31, wherein the requesting device comprises a laptop computer. 39.The method of claim 31, wherein the requesting device comprises atablet.
 40. The method of claim 31, wherein the requesting devicecomprises a phone.